./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:35:46,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:35:46,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:35:46,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:35:46,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:35:46,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:35:46,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:35:46,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:35:46,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:35:46,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:35:46,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:35:46,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:35:46,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:35:46,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:35:46,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:35:46,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:35:46,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:35:46,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:35:46,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:35:46,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:35:46,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:35:46,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:35:46,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:35:46,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:35:46,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:35:46,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:35:46,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:35:46,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:35:46,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:35:46,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:35:46,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:35:46,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:35:46,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:35:46,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:35:46,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:35:46,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:35:46,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:35:46,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:35:46,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:35:46,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:35:46,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:35:46,099 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 10:35:46,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:35:46,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:35:46,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:35:46,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:35:46,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:35:46,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:35:46,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:35:46,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:35:46,136 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:35:46,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:35:46,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:35:46,150 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:35:46,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:35:46,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:35:46,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:35:46,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:35:46,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:35:46,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:35:46,151 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 10:35:46,151 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:35:46,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:35:46,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:35:46,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:35:46,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:35:46,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:35:46,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:35:46,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:46,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:35:46,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:35:46,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:35:46,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:35:46,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:35:46,155 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:35:46,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:35:46,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:35:46,156 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_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 [2022-11-20 10:35:46,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:35:46,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:35:46,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:35:46,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:35:46,501 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:35:46,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-11-20 10:35:49,475 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:35:49,750 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:35:49,751 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-11-20 10:35:49,762 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/data/922488f14/1e985619c0fc41bbbf46844c393357c5/FLAGf63a84389 [2022-11-20 10:35:49,781 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/data/922488f14/1e985619c0fc41bbbf46844c393357c5 [2022-11-20 10:35:49,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:35:49,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:35:49,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:49,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:35:49,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:35:49,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:49" (1/1) ... [2022-11-20 10:35:49,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8ff7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:49, skipping insertion in model container [2022-11-20 10:35:49,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:49" (1/1) ... [2022-11-20 10:35:49,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:35:49,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:35:50,001 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_86aff401-0489-4f8a-899c-cee0a0b3e0be/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-11-20 10:35:50,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:50,019 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:35:50,046 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_86aff401-0489-4f8a-899c-cee0a0b3e0be/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-11-20 10:35:50,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:50,067 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:35:50,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50 WrapperNode [2022-11-20 10:35:50,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:50,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:50,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:35:50,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:35:50,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,122 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2022-11-20 10:35:50,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:50,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:35:50,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:35:50,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:35:50,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:35:50,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:35:50,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:35:50,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:35:50,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (1/1) ... [2022-11-20 10:35:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:50,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:50,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:35:50,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:35:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:35:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:35:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:35:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:35:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 10:35:50,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 10:35:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 10:35:50,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 10:35:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 10:35:50,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 10:35:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:35:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:35:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:35:50,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:35:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:35:50,287 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:35:50,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:35:50,440 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:35:51,112 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:35:51,124 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:35:51,124 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 10:35:51,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:51 BoogieIcfgContainer [2022-11-20 10:35:51,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:35:51,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:35:51,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:35:51,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:35:51,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:35:49" (1/3) ... [2022-11-20 10:35:51,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2123b488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:51, skipping insertion in model container [2022-11-20 10:35:51,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:50" (2/3) ... [2022-11-20 10:35:51,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2123b488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:51, skipping insertion in model container [2022-11-20 10:35:51,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:51" (3/3) ... [2022-11-20 10:35:51,152 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-11-20 10:35:51,162 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:35:51,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:35:51,196 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-20 10:35:51,196 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:35:51,412 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 10:35:51,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 289 transitions, 602 flow [2022-11-20 10:35:51,694 INFO L130 PetriNetUnfolder]: 13/286 cut-off events. [2022-11-20 10:35:51,695 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 10:35:51,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 286 events. 13/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2022-11-20 10:35:51,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 289 transitions, 602 flow [2022-11-20 10:35:51,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 266 transitions, 550 flow [2022-11-20 10:35:51,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:35:51,736 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;@16002652, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:35:51,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2022-11-20 10:35:51,745 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-20 10:35:51,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:35:51,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:51,752 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-20 10:35:51,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 444636234, now seen corresponding path program 1 times [2022-11-20 10:35:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:51,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962341184] [2022-11-20 10:35:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:52,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962341184] [2022-11-20 10:35:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962341184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:52,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:52,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102684449] [2022-11-20 10:35:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:52,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:52,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-11-20 10:35:52,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 266 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:52,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-11-20 10:35:52,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:52,387 INFO L130 PetriNetUnfolder]: 60/637 cut-off events. [2022-11-20 10:35:52,388 INFO L131 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2022-11-20 10:35:52,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 637 events. 60/637 cut-off events. For 81/93 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2983 event pairs, 39 based on Foata normal form. 34/534 useless extension candidates. Maximal degree in co-relation 568. Up to 99 conditions per place. [2022-11-20 10:35:52,401 INFO L137 encePairwiseOnDemand]: 279/289 looper letters, 21 selfloop transitions, 2 changer transitions 3/258 dead transitions. [2022-11-20 10:35:52,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 258 transitions, 580 flow [2022-11-20 10:35:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2022-11-20 10:35:52,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2022-11-20 10:35:52,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 799 transitions. [2022-11-20 10:35:52,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 799 transitions. [2022-11-20 10:35:52,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:52,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 799 transitions. [2022-11-20 10:35:52,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,457 INFO L175 Difference]: Start difference. First operand has 264 places, 266 transitions, 550 flow. Second operand 3 states and 799 transitions. [2022-11-20 10:35:52,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 258 transitions, 580 flow [2022-11-20 10:35:52,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 10:35:52,473 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 520 flow [2022-11-20 10:35:52,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-11-20 10:35:52,482 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -5 predicate places. [2022-11-20 10:35:52,483 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 520 flow [2022-11-20 10:35:52,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,484 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:52,484 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] [2022-11-20 10:35:52,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:35:52,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1903590535, now seen corresponding path program 1 times [2022-11-20 10:35:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:52,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54057652] [2022-11-20 10:35:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:52,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54057652] [2022-11-20 10:35:52,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54057652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:52,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:52,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265106743] [2022-11-20 10:35:52,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:52,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:52,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:52,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-11-20 10:35:52,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:52,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-11-20 10:35:52,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:52,830 INFO L130 PetriNetUnfolder]: 36/538 cut-off events. [2022-11-20 10:35:52,830 INFO L131 PetriNetUnfolder]: For 9/26 co-relation queries the response was YES. [2022-11-20 10:35:52,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 538 events. 36/538 cut-off events. For 9/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2246 event pairs, 21 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 593. Up to 74 conditions per place. [2022-11-20 10:35:52,836 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2022-11-20 10:35:52,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 254 transitions, 564 flow [2022-11-20 10:35:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2022-11-20 10:35:52,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9134948096885813 [2022-11-20 10:35:52,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2022-11-20 10:35:52,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2022-11-20 10:35:52,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:52,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2022-11-20 10:35:52,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,847 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 520 flow. Second operand 3 states and 792 transitions. [2022-11-20 10:35:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 254 transitions, 564 flow [2022-11-20 10:35:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:35:52,853 INFO L231 Difference]: Finished difference. Result has 255 places, 254 transitions, 518 flow [2022-11-20 10:35:52,854 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=255, PETRI_TRANSITIONS=254} [2022-11-20 10:35:52,855 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -9 predicate places. [2022-11-20 10:35:52,855 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 254 transitions, 518 flow [2022-11-20 10:35:52,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,856 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:52,856 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] [2022-11-20 10:35:52,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:35:52,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1608973978, now seen corresponding path program 1 times [2022-11-20 10:35:52,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:52,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071779799] [2022-11-20 10:35:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:52,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-20 10:35:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:52,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071779799] [2022-11-20 10:35:52,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071779799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:52,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:52,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542564326] [2022-11-20 10:35:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:52,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:52,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:52,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-20 10:35:52,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:52,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:52,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-20 10:35:52,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:53,076 INFO L130 PetriNetUnfolder]: 25/487 cut-off events. [2022-11-20 10:35:53,077 INFO L131 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2022-11-20 10:35:53,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 487 events. 25/487 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1843 event pairs, 12 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 505. Up to 46 conditions per place. [2022-11-20 10:35:53,083 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/250 dead transitions. [2022-11-20 10:35:53,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 542 flow [2022-11-20 10:35:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-20 10:35:53,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-11-20 10:35:53,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-20 10:35:53,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-20 10:35:53,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:53,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-20 10:35:53,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,095 INFO L175 Difference]: Start difference. First operand has 255 places, 254 transitions, 518 flow. Second operand 3 states and 797 transitions. [2022-11-20 10:35:53,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 542 flow [2022-11-20 10:35:53,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:35:53,100 INFO L231 Difference]: Finished difference. Result has 251 places, 250 transitions, 508 flow [2022-11-20 10:35:53,101 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=251, PETRI_TRANSITIONS=250} [2022-11-20 10:35:53,104 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-20 10:35:53,104 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 250 transitions, 508 flow [2022-11-20 10:35:53,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,105 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:53,105 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:53,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:35:53,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:53,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:53,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2112885161, now seen corresponding path program 1 times [2022-11-20 10:35:53,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:53,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898846181] [2022-11-20 10:35:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898846181] [2022-11-20 10:35:53,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898846181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:53,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:53,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093820116] [2022-11-20 10:35:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:53,260 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-20 10:35:53,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 250 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:53,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-20 10:35:53,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:53,692 INFO L130 PetriNetUnfolder]: 224/1619 cut-off events. [2022-11-20 10:35:53,692 INFO L131 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-11-20 10:35:53,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1619 events. 224/1619 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12276 event pairs, 135 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1926. Up to 322 conditions per place. [2022-11-20 10:35:53,711 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 18 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2022-11-20 10:35:53,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 546 flow [2022-11-20 10:35:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2022-11-20 10:35:53,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9204152249134948 [2022-11-20 10:35:53,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2022-11-20 10:35:53,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2022-11-20 10:35:53,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:53,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2022-11-20 10:35:53,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,726 INFO L175 Difference]: Start difference. First operand has 251 places, 250 transitions, 508 flow. Second operand 3 states and 798 transitions. [2022-11-20 10:35:53,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 546 flow [2022-11-20 10:35:53,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:35:53,732 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 509 flow [2022-11-20 10:35:53,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2022-11-20 10:35:53,737 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-20 10:35:53,737 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 509 flow [2022-11-20 10:35:53,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:53,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:53,739 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] [2022-11-20 10:35:53,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:35:53,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 12063358, now seen corresponding path program 1 times [2022-11-20 10:35:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087479578] [2022-11-20 10:35:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087479578] [2022-11-20 10:35:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087479578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:54,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:54,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:35:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509658825] [2022-11-20 10:35:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:54,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:35:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:35:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:35:54,351 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 289 [2022-11-20 10:35:54,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:54,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:54,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 289 [2022-11-20 10:35:54,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:58,830 INFO L130 PetriNetUnfolder]: 7760/21080 cut-off events. [2022-11-20 10:35:58,831 INFO L131 PetriNetUnfolder]: For 84/1596 co-relation queries the response was YES. [2022-11-20 10:35:58,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31758 conditions, 21080 events. 7760/21080 cut-off events. For 84/1596 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 232528 event pairs, 6552 based on Foata normal form. 0/16629 useless extension candidates. Maximal degree in co-relation 31718. Up to 10611 conditions per place. [2022-11-20 10:35:59,032 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 53 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2022-11-20 10:35:59,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 623 flow [2022-11-20 10:35:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:35:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:35:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2022-11-20 10:35:59,037 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7987312572087658 [2022-11-20 10:35:59,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1385 transitions. [2022-11-20 10:35:59,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1385 transitions. [2022-11-20 10:35:59,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:59,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1385 transitions. [2022-11-20 10:35:59,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.83333333333334) internal successors, (1385), 6 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,049 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,049 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 509 flow. Second operand 6 states and 1385 transitions. [2022-11-20 10:35:59,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 623 flow [2022-11-20 10:35:59,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:35:59,055 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 513 flow [2022-11-20 10:35:59,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2022-11-20 10:35:59,058 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-11-20 10:35:59,058 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 513 flow [2022-11-20 10:35:59,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:59,061 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] [2022-11-20 10:35:59,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:35:59,061 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 34551780, now seen corresponding path program 1 times [2022-11-20 10:35:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:59,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349653257] [2022-11-20 10:35:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349653257] [2022-11-20 10:35:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349653257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:59,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:59,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110810559] [2022-11-20 10:35:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:59,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:59,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:59,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-20 10:35:59,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:59,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-20 10:35:59,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:59,242 INFO L130 PetriNetUnfolder]: 37/520 cut-off events. [2022-11-20 10:35:59,243 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-11-20 10:35:59,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 520 events. 37/520 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2091 event pairs, 20 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 574. Up to 56 conditions per place. [2022-11-20 10:35:59,247 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2022-11-20 10:35:59,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 537 flow [2022-11-20 10:35:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-20 10:35:59,251 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-11-20 10:35:59,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-20 10:35:59,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-20 10:35:59,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:59,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-20 10:35:59,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,257 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 513 flow. Second operand 3 states and 797 transitions. [2022-11-20 10:35:59,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 537 flow [2022-11-20 10:35:59,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 244 transitions, 527 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:35:59,262 INFO L231 Difference]: Finished difference. Result has 246 places, 244 transitions, 497 flow [2022-11-20 10:35:59,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=246, PETRI_TRANSITIONS=244} [2022-11-20 10:35:59,265 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-20 10:35:59,265 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 244 transitions, 497 flow [2022-11-20 10:35:59,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:59,266 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] [2022-11-20 10:35:59,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:35:59,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2117582322, now seen corresponding path program 1 times [2022-11-20 10:35:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:59,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452824920] [2022-11-20 10:35:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:59,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452824920] [2022-11-20 10:35:59,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452824920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:59,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:59,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762565010] [2022-11-20 10:35:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:59,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:59,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-20 10:35:59,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 244 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:59,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-20 10:35:59,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:59,405 INFO L130 PetriNetUnfolder]: 18/311 cut-off events. [2022-11-20 10:35:59,405 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-20 10:35:59,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 311 events. 18/311 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 847 event pairs, 6 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 325. Up to 23 conditions per place. [2022-11-20 10:35:59,408 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/244 dead transitions. [2022-11-20 10:35:59,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 244 transitions, 529 flow [2022-11-20 10:35:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-11-20 10:35:59,411 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-11-20 10:35:59,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-11-20 10:35:59,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-11-20 10:35:59,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:59,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-11-20 10:35:59,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,419 INFO L175 Difference]: Start difference. First operand has 246 places, 244 transitions, 497 flow. Second operand 3 states and 812 transitions. [2022-11-20 10:35:59,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 244 transitions, 529 flow [2022-11-20 10:35:59,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 244 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:35:59,425 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 498 flow [2022-11-20 10:35:59,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2022-11-20 10:35:59,426 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-11-20 10:35:59,426 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 498 flow [2022-11-20 10:35:59,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:59,427 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] [2022-11-20 10:35:59,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:35:59,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -817865324, now seen corresponding path program 1 times [2022-11-20 10:35:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:59,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345012223] [2022-11-20 10:35:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:59,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345012223] [2022-11-20 10:35:59,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345012223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:59,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:59,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804525460] [2022-11-20 10:35:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:59,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2022-11-20 10:35:59,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:59,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2022-11-20 10:35:59,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:59,687 INFO L130 PetriNetUnfolder]: 114/1130 cut-off events. [2022-11-20 10:35:59,687 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-11-20 10:35:59,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 1130 events. 114/1130 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7446 event pairs, 29 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 1290. Up to 161 conditions per place. [2022-11-20 10:35:59,698 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 19 selfloop transitions, 3 changer transitions 0/247 dead transitions. [2022-11-20 10:35:59,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 247 transitions, 557 flow [2022-11-20 10:35:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:35:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-20 10:35:59,701 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-11-20 10:35:59,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-20 10:35:59,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-20 10:35:59,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:59,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-20 10:35:59,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,712 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 498 flow. Second operand 3 states and 811 transitions. [2022-11-20 10:35:59,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 247 transitions, 557 flow [2022-11-20 10:35:59,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 247 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:35:59,718 INFO L231 Difference]: Finished difference. Result has 243 places, 242 transitions, 507 flow [2022-11-20 10:35:59,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=243, PETRI_TRANSITIONS=242} [2022-11-20 10:35:59,722 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-11-20 10:35:59,723 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 242 transitions, 507 flow [2022-11-20 10:35:59,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,723 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:59,724 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] [2022-11-20 10:35:59,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:35:59,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:35:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1722324090, now seen corresponding path program 1 times [2022-11-20 10:35:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:59,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930019755] [2022-11-20 10:35:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:59,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930019755] [2022-11-20 10:35:59,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930019755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:59,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:59,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:35:59,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774186391] [2022-11-20 10:35:59,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:59,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:59,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:59,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:59,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-20 10:35:59,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 242 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:59,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:59,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-20 10:35:59,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:00,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([738] thread3EXIT-->L87-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][234], [60#L87-7true, 322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 325#true]) [2022-11-20 10:36:00,060 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-20 10:36:00,060 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-20 10:36:00,060 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-20 10:36:00,060 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-20 10:36:00,060 INFO L130 PetriNetUnfolder]: 63/605 cut-off events. [2022-11-20 10:36:00,060 INFO L131 PetriNetUnfolder]: For 30/38 co-relation queries the response was YES. [2022-11-20 10:36:00,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 605 events. 63/605 cut-off events. For 30/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2897 event pairs, 12 based on Foata normal form. 2/544 useless extension candidates. Maximal degree in co-relation 717. Up to 50 conditions per place. [2022-11-20 10:36:00,066 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2022-11-20 10:36:00,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 539 flow [2022-11-20 10:36:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:36:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:36:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-11-20 10:36:00,069 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-11-20 10:36:00,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-11-20 10:36:00,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-11-20 10:36:00,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:00,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-11-20 10:36:00,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,075 INFO L175 Difference]: Start difference. First operand has 243 places, 242 transitions, 507 flow. Second operand 3 states and 812 transitions. [2022-11-20 10:36:00,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 539 flow [2022-11-20 10:36:00,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:36:00,080 INFO L231 Difference]: Finished difference. Result has 243 places, 240 transitions, 509 flow [2022-11-20 10:36:00,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=243, PETRI_TRANSITIONS=240} [2022-11-20 10:36:00,081 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-11-20 10:36:00,082 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 240 transitions, 509 flow [2022-11-20 10:36:00,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,082 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:00,083 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] [2022-11-20 10:36:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:36:00,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1072662552, now seen corresponding path program 1 times [2022-11-20 10:36:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:00,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43100918] [2022-11-20 10:36:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:00,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43100918] [2022-11-20 10:36:00,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43100918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:00,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:00,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:36:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174626900] [2022-11-20 10:36:00,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:00,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:36:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:00,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:36:00,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:36:00,296 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 289 [2022-11-20 10:36:00,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 240 transitions, 509 flow. Second operand has 7 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:00,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 289 [2022-11-20 10:36:00,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:00,687 INFO L130 PetriNetUnfolder]: 254/1436 cut-off events. [2022-11-20 10:36:00,687 INFO L131 PetriNetUnfolder]: For 44/99 co-relation queries the response was YES. [2022-11-20 10:36:00,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 1436 events. 254/1436 cut-off events. For 44/99 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9297 event pairs, 118 based on Foata normal form. 0/1190 useless extension candidates. Maximal degree in co-relation 1970. Up to 348 conditions per place. [2022-11-20 10:36:00,703 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 57 selfloop transitions, 8 changer transitions 0/265 dead transitions. [2022-11-20 10:36:00,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 265 transitions, 697 flow [2022-11-20 10:36:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:36:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:36:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1978 transitions. [2022-11-20 10:36:00,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8555363321799307 [2022-11-20 10:36:00,709 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1978 transitions. [2022-11-20 10:36:00,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1978 transitions. [2022-11-20 10:36:00,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:00,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1978 transitions. [2022-11-20 10:36:00,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 247.25) internal successors, (1978), 8 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,720 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,721 INFO L175 Difference]: Start difference. First operand has 243 places, 240 transitions, 509 flow. Second operand 8 states and 1978 transitions. [2022-11-20 10:36:00,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 265 transitions, 697 flow [2022-11-20 10:36:00,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:36:00,729 INFO L231 Difference]: Finished difference. Result has 251 places, 243 transitions, 539 flow [2022-11-20 10:36:00,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=539, PETRI_PLACES=251, PETRI_TRANSITIONS=243} [2022-11-20 10:36:00,731 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-20 10:36:00,731 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 243 transitions, 539 flow [2022-11-20 10:36:00,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:00,733 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] [2022-11-20 10:36:00,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:36:00,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2099288416, now seen corresponding path program 1 times [2022-11-20 10:36:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:00,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062318904] [2022-11-20 10:36:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:00,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062318904] [2022-11-20 10:36:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062318904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:00,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:00,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883572464] [2022-11-20 10:36:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:00,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:36:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:36:00,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:36:00,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 289 [2022-11-20 10:36:00,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 243 transitions, 539 flow. Second operand has 5 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:00,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:00,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 289 [2022-11-20 10:36:00,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:01,388 INFO L130 PetriNetUnfolder]: 298/2171 cut-off events. [2022-11-20 10:36:01,388 INFO L131 PetriNetUnfolder]: For 156/202 co-relation queries the response was YES. [2022-11-20 10:36:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 2171 events. 298/2171 cut-off events. For 156/202 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18115 event pairs, 162 based on Foata normal form. 4/1892 useless extension candidates. Maximal degree in co-relation 2793. Up to 381 conditions per place. [2022-11-20 10:36:01,404 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 38 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2022-11-20 10:36:01,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 257 transitions, 659 flow [2022-11-20 10:36:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:36:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:36:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1303 transitions. [2022-11-20 10:36:01,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9017301038062284 [2022-11-20 10:36:01,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1303 transitions. [2022-11-20 10:36:01,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1303 transitions. [2022-11-20 10:36:01,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:01,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1303 transitions. [2022-11-20 10:36:01,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 260.6) internal successors, (1303), 5 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,415 INFO L175 Difference]: Start difference. First operand has 251 places, 243 transitions, 539 flow. Second operand 5 states and 1303 transitions. [2022-11-20 10:36:01,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 257 transitions, 659 flow [2022-11-20 10:36:01,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 649 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:36:01,421 INFO L231 Difference]: Finished difference. Result has 253 places, 244 transitions, 546 flow [2022-11-20 10:36:01,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=253, PETRI_TRANSITIONS=244} [2022-11-20 10:36:01,422 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-11-20 10:36:01,423 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 244 transitions, 546 flow [2022-11-20 10:36:01,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:01,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:36:01,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:36:01,424 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1108507916, now seen corresponding path program 1 times [2022-11-20 10:36:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:01,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51601255] [2022-11-20 10:36:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:01,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51601255] [2022-11-20 10:36:01,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51601255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:01,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:01,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:36:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579698436] [2022-11-20 10:36:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:01,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:36:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:36:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:36:01,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-20 10:36:01,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 244 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:01,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-20 10:36:01,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:01,720 INFO L130 PetriNetUnfolder]: 158/1360 cut-off events. [2022-11-20 10:36:01,721 INFO L131 PetriNetUnfolder]: For 135/155 co-relation queries the response was YES. [2022-11-20 10:36:01,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 1360 events. 158/1360 cut-off events. For 135/155 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9431 event pairs, 31 based on Foata normal form. 15/1260 useless extension candidates. Maximal degree in co-relation 1717. Up to 133 conditions per place. [2022-11-20 10:36:01,732 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 10 selfloop transitions, 2 changer transitions 7/244 dead transitions. [2022-11-20 10:36:01,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 576 flow [2022-11-20 10:36:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:36:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:36:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-20 10:36:01,735 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-11-20 10:36:01,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-20 10:36:01,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-20 10:36:01,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:01,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-20 10:36:01,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,741 INFO L175 Difference]: Start difference. First operand has 253 places, 244 transitions, 546 flow. Second operand 3 states and 811 transitions. [2022-11-20 10:36:01,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 576 flow [2022-11-20 10:36:01,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 244 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:36:01,746 INFO L231 Difference]: Finished difference. Result has 251 places, 235 transitions, 526 flow [2022-11-20 10:36:01,747 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=251, PETRI_TRANSITIONS=235} [2022-11-20 10:36:01,747 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-20 10:36:01,748 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 235 transitions, 526 flow [2022-11-20 10:36:01,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:01,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:01,749 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] [2022-11-20 10:36:01,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:36:01,749 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash -371646906, now seen corresponding path program 1 times [2022-11-20 10:36:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:01,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147011930] [2022-11-20 10:36:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:02,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147011930] [2022-11-20 10:36:02,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147011930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:02,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:02,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312187676] [2022-11-20 10:36:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:02,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:36:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:36:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:36:02,181 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-20 10:36:02,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 235 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:02,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:02,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-20 10:36:02,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:05,174 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][184], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 351#(<= (+ ~M~0 1) 0), 360#true, 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:05,174 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-20 10:36:05,174 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:05,174 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:05,175 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-20 10:36:05,754 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][184], [130#thread2ENTRYtrue, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, 360#true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:05,754 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-20 10:36:05,754 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-20 10:36:05,754 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:05,754 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:06,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][184], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 360#true, 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:06,991 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 10:36:06,991 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:06,992 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:06,992 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 10:36:07,038 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 177#L85-7true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,038 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-11-20 10:36:07,038 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-20 10:36:07,039 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-20 10:36:07,039 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-20 10:36:07,251 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 131#L86-2true, 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,252 INFO L383 tUnfolder$Statistics]: this new event has 173 ancestors and is cut-off event [2022-11-20 10:36:07,252 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 10:36:07,252 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-20 10:36:07,252 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-20 10:36:07,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 190#L86-3true, 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,306 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-20 10:36:07,306 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-20 10:36:07,307 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:07,307 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-20 10:36:07,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L86-4true, 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,365 INFO L383 tUnfolder$Statistics]: this new event has 175 ancestors and is cut-off event [2022-11-20 10:36:07,365 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-20 10:36:07,365 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 10:36:07,365 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-20 10:36:07,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 163#L86-5true, 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,416 INFO L383 tUnfolder$Statistics]: this new event has 176 ancestors and is cut-off event [2022-11-20 10:36:07,416 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-20 10:36:07,416 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-20 10:36:07,417 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-20 10:36:07,469 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 242#L86-6true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,469 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-20 10:36:07,469 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:36:07,470 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-20 10:36:07,470 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-20 10:36:07,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][173], [24#L65-6true, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 31#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 358#(= |#race~sum3~0| 0)]) [2022-11-20 10:36:07,470 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-20 10:36:07,471 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 10:36:07,471 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-20 10:36:07,471 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-20 10:36:07,755 INFO L130 PetriNetUnfolder]: 12085/30503 cut-off events. [2022-11-20 10:36:07,755 INFO L131 PetriNetUnfolder]: For 189/472 co-relation queries the response was YES. [2022-11-20 10:36:07,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49555 conditions, 30503 events. 12085/30503 cut-off events. For 189/472 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 334118 event pairs, 3745 based on Foata normal form. 72/26718 useless extension candidates. Maximal degree in co-relation 49507. Up to 7186 conditions per place. [2022-11-20 10:36:08,011 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 117 selfloop transitions, 4 changer transitions 0/306 dead transitions. [2022-11-20 10:36:08,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 306 transitions, 910 flow [2022-11-20 10:36:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:36:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:36:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1478 transitions. [2022-11-20 10:36:08,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8523644752018454 [2022-11-20 10:36:08,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1478 transitions. [2022-11-20 10:36:08,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1478 transitions. [2022-11-20 10:36:08,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:08,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1478 transitions. [2022-11-20 10:36:08,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:08,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:08,024 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:08,024 INFO L175 Difference]: Start difference. First operand has 251 places, 235 transitions, 526 flow. Second operand 6 states and 1478 transitions. [2022-11-20 10:36:08,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 306 transitions, 910 flow [2022-11-20 10:36:08,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 306 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:36:08,073 INFO L231 Difference]: Finished difference. Result has 246 places, 234 transitions, 528 flow [2022-11-20 10:36:08,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=246, PETRI_TRANSITIONS=234} [2022-11-20 10:36:08,075 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-20 10:36:08,075 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 234 transitions, 528 flow [2022-11-20 10:36:08,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:08,076 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:08,076 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] [2022-11-20 10:36:08,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:36:08,077 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1095931425, now seen corresponding path program 1 times [2022-11-20 10:36:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:08,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518676121] [2022-11-20 10:36:08,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:08,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:08,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:08,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518676121] [2022-11-20 10:36:08,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518676121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:08,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:08,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562578122] [2022-11-20 10:36:08,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:08,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:36:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:36:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:36:08,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-20 10:36:08,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 234 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:08,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:08,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-20 10:36:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:14,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 360#true, 198#L84-4true, 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:14,171 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-20 10:36:14,171 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-20 10:36:14,171 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:14,172 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:15,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [130#thread2ENTRYtrue, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 161#L65-3true, 314#(= |#race~M~0| 0), 36#L49-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 360#true, 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:15,232 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-20 10:36:15,232 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:15,232 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:15,232 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-20 10:36:16,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 360#true, 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:16,460 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 10:36:16,460 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 10:36:16,460 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:16,460 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:16,824 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), Black: 320#true, 161#L65-3true, 314#(= |#race~M~0| 0), 362#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 36#L49-3true, 180#L57-3true, 138#L85-2true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true]) [2022-11-20 10:36:16,825 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-20 10:36:16,825 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:36:16,825 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 10:36:16,825 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 10:36:16,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 161#L65-3true, 299#(= |#race~N~0| 0), 247#L85-3true, 314#(= |#race~M~0| 0), 36#L49-3true, 363#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:16,890 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-20 10:36:16,890 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:36:16,890 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:36:16,891 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:36:16,936 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 364#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 367#true, 188#L85-4true]) [2022-11-20 10:36:16,936 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-20 10:36:16,936 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 10:36:16,936 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 10:36:16,936 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 10:36:17,157 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 125#L85-5true, 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:17,157 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-20 10:36:17,157 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 10:36:17,157 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 10:36:17,157 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 10:36:17,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 9#L85-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 161#L65-3true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 365#(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)), 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:17,175 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-20 10:36:17,175 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:36:17,175 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:36:17,175 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:36:17,323 INFO L130 PetriNetUnfolder]: 23566/58783 cut-off events. [2022-11-20 10:36:17,323 INFO L131 PetriNetUnfolder]: For 8596/8596 co-relation queries the response was YES. [2022-11-20 10:36:17,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101777 conditions, 58783 events. 23566/58783 cut-off events. For 8596/8596 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 715828 event pairs, 12497 based on Foata normal form. 0/53498 useless extension candidates. Maximal degree in co-relation 101730. Up to 19940 conditions per place. [2022-11-20 10:36:17,761 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 158 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2022-11-20 10:36:17,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 341 transitions, 1108 flow [2022-11-20 10:36:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:36:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:36:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1495 transitions. [2022-11-20 10:36:17,766 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8621683967704729 [2022-11-20 10:36:17,767 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1495 transitions. [2022-11-20 10:36:17,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1495 transitions. [2022-11-20 10:36:17,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:17,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1495 transitions. [2022-11-20 10:36:17,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:17,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:17,775 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:17,775 INFO L175 Difference]: Start difference. First operand has 246 places, 234 transitions, 528 flow. Second operand 6 states and 1495 transitions. [2022-11-20 10:36:17,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 341 transitions, 1108 flow [2022-11-20 10:36:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 341 transitions, 1073 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:36:17,806 INFO L231 Difference]: Finished difference. Result has 246 places, 233 transitions, 529 flow [2022-11-20 10:36:17,807 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=529, PETRI_PLACES=246, PETRI_TRANSITIONS=233} [2022-11-20 10:36:17,808 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-20 10:36:17,808 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 233 transitions, 529 flow [2022-11-20 10:36:17,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:17,809 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:17,809 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] [2022-11-20 10:36:17,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:36:17,810 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:17,810 INFO L85 PathProgramCache]: Analyzing trace with hash 635641522, now seen corresponding path program 1 times [2022-11-20 10:36:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:17,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282428292] [2022-11-20 10:36:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:18,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282428292] [2022-11-20 10:36:18,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282428292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:18,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:18,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049243911] [2022-11-20 10:36:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:18,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:36:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:36:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:36:18,243 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-20 10:36:18,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 233 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:18,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:18,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-20 10:36:18,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:21,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true, 204#L83-4true]) [2022-11-20 10:36:21,807 INFO L383 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-11-20 10:36:21,807 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 10:36:21,807 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-20 10:36:21,807 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-20 10:36:24,708 INFO L130 PetriNetUnfolder]: 18385/43344 cut-off events. [2022-11-20 10:36:24,708 INFO L131 PetriNetUnfolder]: For 3508/3622 co-relation queries the response was YES. [2022-11-20 10:36:24,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75899 conditions, 43344 events. 18385/43344 cut-off events. For 3508/3622 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 487366 event pairs, 8670 based on Foata normal form. 0/39733 useless extension candidates. Maximal degree in co-relation 75852. Up to 13844 conditions per place. [2022-11-20 10:36:24,984 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 176 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2022-11-20 10:36:24,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 360 transitions, 1189 flow [2022-11-20 10:36:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:36:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:36:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1514 transitions. [2022-11-20 10:36:24,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8731257208765859 [2022-11-20 10:36:24,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1514 transitions. [2022-11-20 10:36:24,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1514 transitions. [2022-11-20 10:36:24,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:24,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1514 transitions. [2022-11-20 10:36:24,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.33333333333334) internal successors, (1514), 6 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:24,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:24,994 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:24,994 INFO L175 Difference]: Start difference. First operand has 246 places, 233 transitions, 529 flow. Second operand 6 states and 1514 transitions. [2022-11-20 10:36:24,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 360 transitions, 1189 flow [2022-11-20 10:36:25,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 360 transitions, 1147 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:36:25,017 INFO L231 Difference]: Finished difference. Result has 245 places, 232 transitions, 527 flow [2022-11-20 10:36:25,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=245, PETRI_TRANSITIONS=232} [2022-11-20 10:36:25,019 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-11-20 10:36:25,019 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 232 transitions, 527 flow [2022-11-20 10:36:25,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:25,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:25,020 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] [2022-11-20 10:36:25,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:36:25,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1828133762, now seen corresponding path program 1 times [2022-11-20 10:36:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:25,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017320785] [2022-11-20 10:36:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:25,422 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-20 10:36:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:25,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017320785] [2022-11-20 10:36:25,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017320785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:25,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:25,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060926175] [2022-11-20 10:36:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:25,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:36:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:36:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:36:25,430 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-20 10:36:25,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 232 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:25,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:25,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-20 10:36:25,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:31,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 381#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true]) [2022-11-20 10:36:31,416 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 10:36:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 10:36:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:31,417 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-20 10:36:31,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 381#true, 138#L85-2true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true]) [2022-11-20 10:36:31,467 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-20 10:36:31,467 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-11-20 10:36:31,467 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 10:36:31,467 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 10:36:31,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 363#(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)), 381#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true]) [2022-11-20 10:36:31,477 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-20 10:36:31,478 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:36:31,478 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:36:31,478 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-20 10:36:31,487 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 364#(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)), 381#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true]) [2022-11-20 10:36:31,487 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-20 10:36:31,487 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 10:36:31,487 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-20 10:36:31,487 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 10:36:31,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 125#L85-5true, 365#(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)), 381#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true]) [2022-11-20 10:36:31,495 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-20 10:36:31,495 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 10:36:31,495 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 10:36:31,495 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-20 10:36:31,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), 9#L85-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 365#(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)), 381#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 374#true]) [2022-11-20 10:36:31,504 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-20 10:36:31,505 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-20 10:36:31,505 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:36:31,505 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 10:36:31,517 INFO L130 PetriNetUnfolder]: 17672/44290 cut-off events. [2022-11-20 10:36:31,517 INFO L131 PetriNetUnfolder]: For 4582/5005 co-relation queries the response was YES. [2022-11-20 10:36:31,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77669 conditions, 44290 events. 17672/44290 cut-off events. For 4582/5005 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 504876 event pairs, 10154 based on Foata normal form. 0/41499 useless extension candidates. Maximal degree in co-relation 77622. Up to 15756 conditions per place. [2022-11-20 10:36:31,879 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 124 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2022-11-20 10:36:31,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 307 transitions, 979 flow [2022-11-20 10:36:31,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:36:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:36:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1461 transitions. [2022-11-20 10:36:31,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.842560553633218 [2022-11-20 10:36:31,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1461 transitions. [2022-11-20 10:36:31,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1461 transitions. [2022-11-20 10:36:31,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:31,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1461 transitions. [2022-11-20 10:36:31,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:31,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:31,896 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:31,896 INFO L175 Difference]: Start difference. First operand has 245 places, 232 transitions, 527 flow. Second operand 6 states and 1461 transitions. [2022-11-20 10:36:31,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 307 transitions, 979 flow [2022-11-20 10:36:31,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 307 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:36:31,922 INFO L231 Difference]: Finished difference. Result has 244 places, 231 transitions, 525 flow [2022-11-20 10:36:31,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=244, PETRI_TRANSITIONS=231} [2022-11-20 10:36:31,923 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -20 predicate places. [2022-11-20 10:36:31,924 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 231 transitions, 525 flow [2022-11-20 10:36:31,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:31,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:31,925 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-20 10:36:31,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:36:31,925 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1969701154, now seen corresponding path program 1 times [2022-11-20 10:36:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:31,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337018423] [2022-11-20 10:36:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337018423] [2022-11-20 10:36:31,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337018423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:31,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:31,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:36:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437511708] [2022-11-20 10:36:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:31,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:36:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:31,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:36:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:36:31,996 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-20 10:36:31,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 231 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:31,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:31,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-20 10:36:31,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:32,262 INFO L130 PetriNetUnfolder]: 95/1172 cut-off events. [2022-11-20 10:36:32,262 INFO L131 PetriNetUnfolder]: For 57/71 co-relation queries the response was YES. [2022-11-20 10:36:32,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 1172 events. 95/1172 cut-off events. For 57/71 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7268 event pairs, 28 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 1453. Up to 111 conditions per place. [2022-11-20 10:36:32,274 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2022-11-20 10:36:32,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 232 transitions, 555 flow [2022-11-20 10:36:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:36:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:36:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-20 10:36:32,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-20 10:36:32,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:32,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,284 INFO L175 Difference]: Start difference. First operand has 244 places, 231 transitions, 525 flow. Second operand 3 states and 803 transitions. [2022-11-20 10:36:32,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 232 transitions, 555 flow [2022-11-20 10:36:32,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 232 transitions, 545 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:36:32,290 INFO L231 Difference]: Finished difference. Result has 240 places, 230 transitions, 517 flow [2022-11-20 10:36:32,291 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=240, PETRI_TRANSITIONS=230} [2022-11-20 10:36:32,291 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-20 10:36:32,291 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 230 transitions, 517 flow [2022-11-20 10:36:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:32,292 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:36:32,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:36:32,293 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash 777045301, now seen corresponding path program 1 times [2022-11-20 10:36:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:32,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862184129] [2022-11-20 10:36:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:32,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862184129] [2022-11-20 10:36:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862184129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:32,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:36:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6697271] [2022-11-20 10:36:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:36:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:36:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:36:32,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-20 10:36:32,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 230 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:32,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-20 10:36:32,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:32,639 INFO L130 PetriNetUnfolder]: 170/1270 cut-off events. [2022-11-20 10:36:32,639 INFO L131 PetriNetUnfolder]: For 139/152 co-relation queries the response was YES. [2022-11-20 10:36:32,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 1270 events. 170/1270 cut-off events. For 139/152 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8676 event pairs, 57 based on Foata normal form. 0/1182 useless extension candidates. Maximal degree in co-relation 1643. Up to 212 conditions per place. [2022-11-20 10:36:32,651 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2022-11-20 10:36:32,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 231 transitions, 547 flow [2022-11-20 10:36:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:36:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:36:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-20 10:36:32,654 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-20 10:36:32,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:32,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,661 INFO L175 Difference]: Start difference. First operand has 240 places, 230 transitions, 517 flow. Second operand 3 states and 803 transitions. [2022-11-20 10:36:32,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 231 transitions, 547 flow [2022-11-20 10:36:32,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 231 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:36:32,667 INFO L231 Difference]: Finished difference. Result has 239 places, 229 transitions, 515 flow [2022-11-20 10:36:32,667 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=239, PETRI_TRANSITIONS=229} [2022-11-20 10:36:32,668 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -25 predicate places. [2022-11-20 10:36:32,668 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 229 transitions, 515 flow [2022-11-20 10:36:32,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:32,669 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-20 10:36:32,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:36:32,669 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1638244027, now seen corresponding path program 1 times [2022-11-20 10:36:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:32,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603809548] [2022-11-20 10:36:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:32,730 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-20 10:36:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603809548] [2022-11-20 10:36:32,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603809548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:32,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:32,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:36:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489900703] [2022-11-20 10:36:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:32,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:36:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:36:32,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:36:32,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-20 10:36:32,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 229 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:32,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-20 10:36:32,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:32,969 INFO L130 PetriNetUnfolder]: 77/1083 cut-off events. [2022-11-20 10:36:32,969 INFO L131 PetriNetUnfolder]: For 26/42 co-relation queries the response was YES. [2022-11-20 10:36:32,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 1083 events. 77/1083 cut-off events. For 26/42 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6444 event pairs, 29 based on Foata normal form. 1/1045 useless extension candidates. Maximal degree in co-relation 1368. Up to 119 conditions per place. [2022-11-20 10:36:32,978 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-20 10:36:32,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 230 transitions, 545 flow [2022-11-20 10:36:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:36:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:36:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-20 10:36:32,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-20 10:36:32,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:32,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-20 10:36:32,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,988 INFO L175 Difference]: Start difference. First operand has 239 places, 229 transitions, 515 flow. Second operand 3 states and 803 transitions. [2022-11-20 10:36:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 230 transitions, 545 flow [2022-11-20 10:36:32,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 230 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:36:32,994 INFO L231 Difference]: Finished difference. Result has 238 places, 228 transitions, 513 flow [2022-11-20 10:36:32,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=238, PETRI_TRANSITIONS=228} [2022-11-20 10:36:32,995 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -26 predicate places. [2022-11-20 10:36:32,996 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 228 transitions, 513 flow [2022-11-20 10:36:32,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:32,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:32,996 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] [2022-11-20 10:36:32,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:36:32,997 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1413192531, now seen corresponding path program 1 times [2022-11-20 10:36:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:32,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619586263] [2022-11-20 10:36:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619586263] [2022-11-20 10:36:33,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619586263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:33,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:33,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199850178] [2022-11-20 10:36:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:33,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:36:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:36:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:36:33,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-20 10:36:33,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 228 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:33,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:33,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-20 10:36:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:35,425 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 396#true, 400#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:35,426 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-20 10:36:35,426 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-20 10:36:35,426 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:35,426 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:35,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [130#thread2ENTRYtrue, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, 396#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:35,769 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-20 10:36:35,769 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:35,769 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-20 10:36:35,769 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:36,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 396#true, 400#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:36,539 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 10:36:36,539 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:36,540 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:36,540 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 10:36:36,959 INFO L130 PetriNetUnfolder]: 7151/24530 cut-off events. [2022-11-20 10:36:36,959 INFO L131 PetriNetUnfolder]: For 153/453 co-relation queries the response was YES. [2022-11-20 10:36:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 24530 events. 7151/24530 cut-off events. For 153/453 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 301524 event pairs, 5038 based on Foata normal form. 16/23738 useless extension candidates. Maximal degree in co-relation 36964. Up to 8023 conditions per place. [2022-11-20 10:36:37,100 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 81 selfloop transitions, 4 changer transitions 0/267 dead transitions. [2022-11-20 10:36:37,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 267 transitions, 761 flow [2022-11-20 10:36:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:36:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:36:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1442 transitions. [2022-11-20 10:36:37,109 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.831603229527105 [2022-11-20 10:36:37,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1442 transitions. [2022-11-20 10:36:37,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1442 transitions. [2022-11-20 10:36:37,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:37,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1442 transitions. [2022-11-20 10:36:37,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.33333333333334) internal successors, (1442), 6 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:37,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:37,120 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:37,120 INFO L175 Difference]: Start difference. First operand has 238 places, 228 transitions, 513 flow. Second operand 6 states and 1442 transitions. [2022-11-20 10:36:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 267 transitions, 761 flow [2022-11-20 10:36:37,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 267 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:36:37,192 INFO L231 Difference]: Finished difference. Result has 240 places, 227 transitions, 515 flow [2022-11-20 10:36:37,193 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=240, PETRI_TRANSITIONS=227} [2022-11-20 10:36:37,193 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-20 10:36:37,194 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 227 transitions, 515 flow [2022-11-20 10:36:37,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:37,194 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:36:37,195 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] [2022-11-20 10:36:37,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:36:37,195 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-20 10:36:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1179725226, now seen corresponding path program 1 times [2022-11-20 10:36:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277202403] [2022-11-20 10:36:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:37,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277202403] [2022-11-20 10:36:37,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277202403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:37,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:37,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:36:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337026349] [2022-11-20 10:36:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:36:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:36:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:36:37,612 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-20 10:36:37,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 227 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:37,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:36:37,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-20 10:36:37,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:36:39,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 407#true, 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:39,638 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-20 10:36:39,638 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:39,638 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-20 10:36:39,638 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-20 10:36:40,271 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [130#thread2ENTRYtrue, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 407#true, 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:40,272 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-20 10:36:40,272 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:40,272 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 10:36:40,272 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-20 10:36:40,678 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 407#true, 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, 180#L57-3true, Black: 339#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 198#L84-4true, Black: 343#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0))]) [2022-11-20 10:36:40,678 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 10:36:40,679 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:40,679 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 10:36:40,679 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 10:36:41,380 INFO L130 PetriNetUnfolder]: 7065/24550 cut-off events. [2022-11-20 10:36:41,380 INFO L131 PetriNetUnfolder]: For 338/586 co-relation queries the response was YES. [2022-11-20 10:36:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36624 conditions, 24550 events. 7065/24550 cut-off events. For 338/586 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 303309 event pairs, 5723 based on Foata normal form. 0/23733 useless extension candidates. Maximal degree in co-relation 36576. Up to 9332 conditions per place. [2022-11-20 10:36:41,461 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 0 selfloop transitions, 0 changer transitions 246/246 dead transitions. [2022-11-20 10:36:41,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 246 transitions, 681 flow [2022-11-20 10:36:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:36:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:36:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1421 transitions. [2022-11-20 10:36:41,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8194925028835064 [2022-11-20 10:36:41,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1421 transitions. [2022-11-20 10:36:41,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1421 transitions. [2022-11-20 10:36:41,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:36:41,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1421 transitions. [2022-11-20 10:36:41,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:41,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:41,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:41,473 INFO L175 Difference]: Start difference. First operand has 240 places, 227 transitions, 515 flow. Second operand 6 states and 1421 transitions. [2022-11-20 10:36:41,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 246 transitions, 681 flow [2022-11-20 10:36:41,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 246 transitions, 674 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:36:41,488 INFO L231 Difference]: Finished difference. Result has 240 places, 0 transitions, 0 flow [2022-11-20 10:36:41,488 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=240, PETRI_TRANSITIONS=0} [2022-11-20 10:36:41,489 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-20 10:36:41,489 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 0 transitions, 0 flow [2022-11-20 10:36:41,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:41,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2022-11-20 10:36:41,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2022-11-20 10:36:41,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2022-11-20 10:36:41,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2022-11-20 10:36:41,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2022-11-20 10:36:41,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2022-11-20 10:36:41,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2022-11-20 10:36:41,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2022-11-20 10:36:41,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2022-11-20 10:36:41,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2022-11-20 10:36:41,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2022-11-20 10:36:41,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2022-11-20 10:36:41,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2022-11-20 10:36:41,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2022-11-20 10:36:41,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2022-11-20 10:36:41,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2022-11-20 10:36:41,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2022-11-20 10:36:41,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2022-11-20 10:36:41,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2022-11-20 10:36:41,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2022-11-20 10:36:41,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2022-11-20 10:36:41,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2022-11-20 10:36:41,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2022-11-20 10:36:41,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2022-11-20 10:36:41,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2022-11-20 10:36:41,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2022-11-20 10:36:41,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2022-11-20 10:36:41,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2022-11-20 10:36:41,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2022-11-20 10:36:41,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2022-11-20 10:36:41,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 49 remaining) [2022-11-20 10:36:41,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 49 remaining) [2022-11-20 10:36:41,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 49 remaining) [2022-11-20 10:36:41,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2022-11-20 10:36:41,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2022-11-20 10:36:41,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2022-11-20 10:36:41,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2022-11-20 10:36:41,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2022-11-20 10:36:41,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2022-11-20 10:36:41,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2022-11-20 10:36:41,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2022-11-20 10:36:41,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2022-11-20 10:36:41,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2022-11-20 10:36:41,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2022-11-20 10:36:41,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2022-11-20 10:36:41,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2022-11-20 10:36:41,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2022-11-20 10:36:41,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2022-11-20 10:36:41,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2022-11-20 10:36:41,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:36:41,507 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:36:41,516 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:36:41,516 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:36:41,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:36:41 BasicIcfg [2022-11-20 10:36:41,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:36:41,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:36:41,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:36:41,524 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:36:41,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:51" (3/4) ... [2022-11-20 10:36:41,527 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:36:41,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-20 10:36:41,534 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-20 10:36:41,534 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-20 10:36:41,541 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-20 10:36:41,542 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 10:36:41,542 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:36:41,542 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:36:41,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:36:41,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:36:41,604 INFO L158 Benchmark]: Toolchain (without parser) took 51817.78ms. Allocated memory was 167.8MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 134.4MB in the beginning and 11.0GB in the end (delta: -10.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-20 10:36:41,605 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:36:41,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.44ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 121.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:36:41,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 119.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:36:41,605 INFO L158 Benchmark]: Boogie Preprocessor took 48.49ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 117.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:36:41,606 INFO L158 Benchmark]: RCFGBuilder took 970.22ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 92.5MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 10:36:41,606 INFO L158 Benchmark]: TraceAbstraction took 50376.61ms. Allocated memory was 167.8MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 91.5MB in the beginning and 11.0GB in the end (delta: -10.9GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-20 10:36:41,607 INFO L158 Benchmark]: Witness Printer took 81.33ms. Allocated memory is still 13.4GB. Free memory was 11.0GB in the beginning and 11.0GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:36:41,609 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.48ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.44ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 121.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 119.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.49ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 117.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 970.22ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 92.5MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50376.61ms. Allocated memory was 167.8MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 91.5MB in the beginning and 11.0GB in the end (delta: -10.9GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 81.33ms. Allocated memory is still 13.4GB. Free memory was 11.0GB in the beginning and 11.0GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: 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, 376 locations, 49 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: 50.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2051 IncrementalHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 396 mSDtfsCounter, 2051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=0, InterpolantAutomatonStates: 91, 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.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1900 NumberOfCodeBlocks, 1900 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 2820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 2/2 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 10:36:41,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86aff401-0489-4f8a-899c-cee0a0b3e0be/bin/uautomizer-ug76WZFUDN/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