./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a 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_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc --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 e2cb2ea6991951b6a9c5c1df0de2ac5ff84f75971959d591fa5f258025f94929 --- 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-5e519f3 [2022-11-02 21:06:44,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:06:44,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:06:44,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:06:44,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:06:44,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:06:44,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:06:44,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:06:44,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:06:44,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:06:44,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:06:44,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:06:44,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:06:44,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:06:44,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:06:44,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:06:44,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:06:44,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:06:44,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:06:44,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:06:44,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:06:44,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:06:44,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:06:44,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:06:44,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:06:44,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:06:44,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:06:44,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:06:44,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:06:44,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:06:44,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:06:44,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:06:44,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:06:44,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:06:44,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:06:44,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:06:44,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:06:44,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:06:44,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:06:44,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:06:44,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:06:44,224 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 21:06:44,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:06:44,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:06:44,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:06:44,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:06:44,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:06:44,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:06:44,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:06:44,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:06:44,265 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:06:44,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:06:44,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:06:44,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:06:44,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:06:44,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:06:44,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:06:44,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:06:44,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:06:44,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:06:44,268 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 21:06:44,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:06:44,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:06:44,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:06:44,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:06:44,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:06:44,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:06:44,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:06:44,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:06:44,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:06:44,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:06:44,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:06:44,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:06:44,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:06:44,272 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:06:44,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:06:44,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:06:44,273 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_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/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_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc 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 -> e2cb2ea6991951b6a9c5c1df0de2ac5ff84f75971959d591fa5f258025f94929 [2022-11-02 21:06:44,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:06:44,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:06:44,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:06:44,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:06:44,561 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:06:44,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2022-11-02 21:06:44,627 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/data/c1935e3f0/67f1b40934ed4b6d897f5cd22521aec9/FLAG0d49a3a1d [2022-11-02 21:06:45,050 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:06:45,051 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2022-11-02 21:06:45,071 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/data/c1935e3f0/67f1b40934ed4b6d897f5cd22521aec9/FLAG0d49a3a1d [2022-11-02 21:06:45,450 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/data/c1935e3f0/67f1b40934ed4b6d897f5cd22521aec9 [2022-11-02 21:06:45,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:06:45,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:06:45,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:06:45,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:06:45,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:06:45,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759acd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45, skipping insertion in model container [2022-11-02 21:06:45,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:06:45,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:06:45,762 WARN L230 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_4b6cbb87-3472-4b62-89bd-261c4e769c00/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c[3544,3557] [2022-11-02 21:06:45,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:06:45,782 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:06:45,853 WARN L230 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_4b6cbb87-3472-4b62-89bd-261c4e769c00/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c[3544,3557] [2022-11-02 21:06:45,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:06:45,871 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:06:45,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45 WrapperNode [2022-11-02 21:06:45,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:06:45,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:06:45,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:06:45,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:06:45,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,961 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 562 [2022-11-02 21:06:45,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:06:45,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:06:45,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:06:45,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:06:45,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:45,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:46,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:46,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:46,033 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:46,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:46,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:06:46,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:06:46,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:06:46,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:06:46,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (1/1) ... [2022-11-02 21:06:46,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:06:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:46,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:06:46,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:06:46,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:06:46,137 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:06:46,137 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:06:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:06:46,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:06:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:06:46,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:06:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:06:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:06:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:06:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:06:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:06:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:06:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:06:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:06:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:06:46,142 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:06:46,309 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:06:46,325 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:06:47,266 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:06:48,252 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:06:48,253 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:06:48,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:48 BoogieIcfgContainer [2022-11-02 21:06:48,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:06:48,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:06:48,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:06:48,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:06:48,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:06:45" (1/3) ... [2022-11-02 21:06:48,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44437158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:06:48, skipping insertion in model container [2022-11-02 21:06:48,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:45" (2/3) ... [2022-11-02 21:06:48,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44437158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:06:48, skipping insertion in model container [2022-11-02 21:06:48,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:48" (3/3) ... [2022-11-02 21:06:48,266 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2022-11-02 21:06:48,275 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:06:48,284 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:06:48,284 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2022-11-02 21:06:48,285 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:06:48,490 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:06:48,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 284 transitions, 592 flow [2022-11-02 21:06:48,730 INFO L130 PetriNetUnfolder]: 3/281 cut-off events. [2022-11-02 21:06:48,730 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:06:48,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 281 events. 3/281 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 422 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2022-11-02 21:06:48,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 284 transitions, 592 flow [2022-11-02 21:06:48,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 258 transitions, 534 flow [2022-11-02 21:06:48,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:06:48,768 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;@34ff9afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:06:48,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2022-11-02 21:06:48,778 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-11-02 21:06:48,778 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:06:48,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:48,779 INFO L208 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] [2022-11-02 21:06:48,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2000877255, now seen corresponding path program 1 times [2022-11-02 21:06:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:48,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846072491] [2022-11-02 21:06:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,050 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-02 21:06:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:49,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846072491] [2022-11-02 21:06:49,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846072491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:49,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:49,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579466451] [2022-11-02 21:06:49,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:49,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:49,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:49,104 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:49,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 258 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:49,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:49,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:49,314 INFO L130 PetriNetUnfolder]: 15/253 cut-off events. [2022-11-02 21:06:49,314 INFO L131 PetriNetUnfolder]: For 28/35 co-relation queries the response was YES. [2022-11-02 21:06:49,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 253 events. 15/253 cut-off events. For 28/35 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 243 event pairs, 15 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 173. Up to 40 conditions per place. [2022-11-02 21:06:49,317 INFO L137 encePairwiseOnDemand]: 226/284 looper letters, 12 selfloop transitions, 2 changer transitions 1/202 dead transitions. [2022-11-02 21:06:49,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 202 transitions, 450 flow [2022-11-02 21:06:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2022-11-02 21:06:49,332 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8286384976525821 [2022-11-02 21:06:49,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 706 transitions. [2022-11-02 21:06:49,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 706 transitions. [2022-11-02 21:06:49,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:49,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 706 transitions. [2022-11-02 21:06:49,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,350 INFO L175 Difference]: Start difference. First operand has 267 places, 258 transitions, 534 flow. Second operand 3 states and 706 transitions. [2022-11-02 21:06:49,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 202 transitions, 450 flow [2022-11-02 21:06:49,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 202 transitions, 438 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 21:06:49,359 INFO L231 Difference]: Finished difference. Result has 208 places, 201 transitions, 412 flow [2022-11-02 21:06:49,361 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=208, PETRI_TRANSITIONS=201} [2022-11-02 21:06:49,364 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -59 predicate places. [2022-11-02 21:06:49,364 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 201 transitions, 412 flow [2022-11-02 21:06:49,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:49,365 INFO L208 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] [2022-11-02 21:06:49,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:06:49,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash -80908753, now seen corresponding path program 1 times [2022-11-02 21:06:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:49,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881095770] [2022-11-02 21:06:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,490 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-02 21:06:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:49,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881095770] [2022-11-02 21:06:49,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881095770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:49,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:49,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894593210] [2022-11-02 21:06:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:49,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:49,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:49,495 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:49,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 201 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:49,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:49,628 INFO L130 PetriNetUnfolder]: 15/251 cut-off events. [2022-11-02 21:06:49,628 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:49,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 251 events. 15/251 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 261. Up to 40 conditions per place. [2022-11-02 21:06:49,631 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2022-11-02 21:06:49,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 200 transitions, 438 flow [2022-11-02 21:06:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:49,635 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:49,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:49,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:49,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:49,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:49,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,643 INFO L175 Difference]: Start difference. First operand has 208 places, 201 transitions, 412 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:49,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 200 transitions, 438 flow [2022-11-02 21:06:49,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 200 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:49,653 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 410 flow [2022-11-02 21:06:49,653 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2022-11-02 21:06:49,654 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -61 predicate places. [2022-11-02 21:06:49,654 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 410 flow [2022-11-02 21:06:49,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:49,655 INFO L208 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] [2022-11-02 21:06:49,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:06:49,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1224047081, now seen corresponding path program 1 times [2022-11-02 21:06:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:49,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796621671] [2022-11-02 21:06:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,749 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-02 21:06:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796621671] [2022-11-02 21:06:49,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796621671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:49,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:49,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079894812] [2022-11-02 21:06:49,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:49,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:49,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:49,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:49,754 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:49,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:49,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:49,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:49,897 INFO L130 PetriNetUnfolder]: 15/250 cut-off events. [2022-11-02 21:06:49,898 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 250 events. 15/250 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 253. Up to 40 conditions per place. [2022-11-02 21:06:49,899 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2022-11-02 21:06:49,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 199 transitions, 436 flow [2022-11-02 21:06:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:49,902 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:49,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:49,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:49,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:49,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:49,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,909 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 410 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:49,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 199 transitions, 436 flow [2022-11-02 21:06:49,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 199 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:49,914 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 408 flow [2022-11-02 21:06:49,915 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2022-11-02 21:06:49,915 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -62 predicate places. [2022-11-02 21:06:49,916 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 408 flow [2022-11-02 21:06:49,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:49,917 INFO L208 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] [2022-11-02 21:06:49,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:06:49,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1684184752, now seen corresponding path program 1 times [2022-11-02 21:06:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:49,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759341939] [2022-11-02 21:06:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:49,971 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-02 21:06:49,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:49,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759341939] [2022-11-02 21:06:49,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759341939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:49,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:49,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515473564] [2022-11-02 21:06:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:49,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:49,976 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:49,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:49,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:49,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:49,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:50,107 INFO L130 PetriNetUnfolder]: 15/249 cut-off events. [2022-11-02 21:06:50,107 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:50,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 249 events. 15/249 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 239 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 245. Up to 40 conditions per place. [2022-11-02 21:06:50,109 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2022-11-02 21:06:50,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 198 transitions, 434 flow [2022-11-02 21:06:50,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:50,112 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:50,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:50,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,118 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 408 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:50,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 198 transitions, 434 flow [2022-11-02 21:06:50,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 198 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:50,124 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 406 flow [2022-11-02 21:06:50,124 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2022-11-02 21:06:50,125 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -63 predicate places. [2022-11-02 21:06:50,125 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 406 flow [2022-11-02 21:06:50,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:50,126 INFO L208 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] [2022-11-02 21:06:50,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:06:50,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2138797244, now seen corresponding path program 1 times [2022-11-02 21:06:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:50,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633268299] [2022-11-02 21:06:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:50,196 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-02 21:06:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:50,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633268299] [2022-11-02 21:06:50,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633268299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:50,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:50,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072412465] [2022-11-02 21:06:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:50,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:50,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:50,200 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:50,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:50,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:50,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:50,355 INFO L130 PetriNetUnfolder]: 15/248 cut-off events. [2022-11-02 21:06:50,355 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:50,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 248 events. 15/248 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 233 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 237. Up to 40 conditions per place. [2022-11-02 21:06:50,356 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2022-11-02 21:06:50,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 197 transitions, 432 flow [2022-11-02 21:06:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:50,359 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:50,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:50,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,364 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 406 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:50,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 197 transitions, 432 flow [2022-11-02 21:06:50,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 197 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:50,369 INFO L231 Difference]: Finished difference. Result has 203 places, 197 transitions, 404 flow [2022-11-02 21:06:50,369 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=203, PETRI_TRANSITIONS=197} [2022-11-02 21:06:50,372 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -64 predicate places. [2022-11-02 21:06:50,372 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 197 transitions, 404 flow [2022-11-02 21:06:50,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:50,373 INFO L208 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-02 21:06:50,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:06:50,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:50,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1386100855, now seen corresponding path program 1 times [2022-11-02 21:06:50,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:50,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646980270] [2022-11-02 21:06:50,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:50,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:50,462 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-02 21:06:50,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:50,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646980270] [2022-11-02 21:06:50,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646980270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:50,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:50,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:50,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204118830] [2022-11-02 21:06:50,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:50,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:50,466 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:50,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 197 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:50,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:50,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:50,574 INFO L130 PetriNetUnfolder]: 15/247 cut-off events. [2022-11-02 21:06:50,574 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:50,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 247 events. 15/247 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 232 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 229. Up to 40 conditions per place. [2022-11-02 21:06:50,576 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2022-11-02 21:06:50,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 196 transitions, 430 flow [2022-11-02 21:06:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:50,579 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:50,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:50,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,584 INFO L175 Difference]: Start difference. First operand has 203 places, 197 transitions, 404 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:50,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 196 transitions, 430 flow [2022-11-02 21:06:50,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 196 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:50,589 INFO L231 Difference]: Finished difference. Result has 202 places, 196 transitions, 402 flow [2022-11-02 21:06:50,589 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=202, PETRI_TRANSITIONS=196} [2022-11-02 21:06:50,592 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -65 predicate places. [2022-11-02 21:06:50,592 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 196 transitions, 402 flow [2022-11-02 21:06:50,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:50,593 INFO L208 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] [2022-11-02 21:06:50,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:06:50,593 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1199801009, now seen corresponding path program 1 times [2022-11-02 21:06:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057556232] [2022-11-02 21:06:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:50,664 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-02 21:06:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:50,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057556232] [2022-11-02 21:06:50,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057556232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:50,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:50,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78278686] [2022-11-02 21:06:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:50,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:50,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:50,667 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:50,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:50,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:50,773 INFO L130 PetriNetUnfolder]: 15/246 cut-off events. [2022-11-02 21:06:50,774 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 246 events. 15/246 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 237 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 221. Up to 40 conditions per place. [2022-11-02 21:06:50,775 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2022-11-02 21:06:50,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 428 flow [2022-11-02 21:06:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:50,777 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:50,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:50,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,782 INFO L175 Difference]: Start difference. First operand has 202 places, 196 transitions, 402 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 428 flow [2022-11-02 21:06:50,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 195 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:50,787 INFO L231 Difference]: Finished difference. Result has 201 places, 195 transitions, 400 flow [2022-11-02 21:06:50,787 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=201, PETRI_TRANSITIONS=195} [2022-11-02 21:06:50,788 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -66 predicate places. [2022-11-02 21:06:50,788 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 195 transitions, 400 flow [2022-11-02 21:06:50,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:50,789 INFO L208 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] [2022-11-02 21:06:50,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:06:50,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1425146740, now seen corresponding path program 1 times [2022-11-02 21:06:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:50,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585285308] [2022-11-02 21:06:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:50,831 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-02 21:06:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585285308] [2022-11-02 21:06:50,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585285308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:50,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:50,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94153366] [2022-11-02 21:06:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:50,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:50,834 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:50,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:50,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:50,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:50,930 INFO L130 PetriNetUnfolder]: 15/245 cut-off events. [2022-11-02 21:06:50,930 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:50,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 245 events. 15/245 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 229 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 213. Up to 40 conditions per place. [2022-11-02 21:06:50,932 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2022-11-02 21:06:50,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 194 transitions, 426 flow [2022-11-02 21:06:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:50,934 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:50,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:50,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:50,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,940 INFO L175 Difference]: Start difference. First operand has 201 places, 195 transitions, 400 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:50,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 194 transitions, 426 flow [2022-11-02 21:06:50,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 194 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:50,945 INFO L231 Difference]: Finished difference. Result has 200 places, 194 transitions, 398 flow [2022-11-02 21:06:50,945 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=200, PETRI_TRANSITIONS=194} [2022-11-02 21:06:50,947 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -67 predicate places. [2022-11-02 21:06:50,948 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 194 transitions, 398 flow [2022-11-02 21:06:50,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:50,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:50,949 INFO L208 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-02 21:06:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:06:50,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1923739974, now seen corresponding path program 1 times [2022-11-02 21:06:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708131224] [2022-11-02 21:06:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:51,023 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-02 21:06:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708131224] [2022-11-02 21:06:51,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708131224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:51,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:51,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:51,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221642606] [2022-11-02 21:06:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:51,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:51,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:51,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:51,027 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:51,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:51,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:51,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:51,162 INFO L130 PetriNetUnfolder]: 15/244 cut-off events. [2022-11-02 21:06:51,162 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:51,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 244 events. 15/244 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 228 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 205. Up to 40 conditions per place. [2022-11-02 21:06:51,164 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2022-11-02 21:06:51,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 193 transitions, 424 flow [2022-11-02 21:06:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:51,167 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:51,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:51,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,172 INFO L175 Difference]: Start difference. First operand has 200 places, 194 transitions, 398 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:51,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 193 transitions, 424 flow [2022-11-02 21:06:51,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:51,176 INFO L231 Difference]: Finished difference. Result has 199 places, 193 transitions, 396 flow [2022-11-02 21:06:51,177 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=199, PETRI_TRANSITIONS=193} [2022-11-02 21:06:51,177 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -68 predicate places. [2022-11-02 21:06:51,177 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 193 transitions, 396 flow [2022-11-02 21:06:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:51,178 INFO L208 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] [2022-11-02 21:06:51,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:06:51,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1348796832, now seen corresponding path program 1 times [2022-11-02 21:06:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:51,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556046617] [2022-11-02 21:06:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:51,237 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-02 21:06:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:51,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556046617] [2022-11-02 21:06:51,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556046617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:51,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:51,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669268514] [2022-11-02 21:06:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:51,241 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:51,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 193 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:51,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:51,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:51,333 INFO L130 PetriNetUnfolder]: 15/243 cut-off events. [2022-11-02 21:06:51,333 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:51,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 243 events. 15/243 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 227 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 197. Up to 40 conditions per place. [2022-11-02 21:06:51,335 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2022-11-02 21:06:51,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 192 transitions, 422 flow [2022-11-02 21:06:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:51,337 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:51,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:51,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,342 INFO L175 Difference]: Start difference. First operand has 199 places, 193 transitions, 396 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:51,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 192 transitions, 422 flow [2022-11-02 21:06:51,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 192 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:51,346 INFO L231 Difference]: Finished difference. Result has 198 places, 192 transitions, 394 flow [2022-11-02 21:06:51,347 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=198, PETRI_TRANSITIONS=192} [2022-11-02 21:06:51,347 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -69 predicate places. [2022-11-02 21:06:51,347 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 192 transitions, 394 flow [2022-11-02 21:06:51,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:51,348 INFO L208 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] [2022-11-02 21:06:51,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:06:51,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1491938445, now seen corresponding path program 1 times [2022-11-02 21:06:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786450844] [2022-11-02 21:06:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:51,387 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-02 21:06:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:51,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786450844] [2022-11-02 21:06:51,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786450844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:51,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:51,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114913563] [2022-11-02 21:06:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:51,391 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:51,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 192 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:51,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:51,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:51,475 INFO L130 PetriNetUnfolder]: 15/242 cut-off events. [2022-11-02 21:06:51,475 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:51,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 242 events. 15/242 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 227 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 189. Up to 40 conditions per place. [2022-11-02 21:06:51,476 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2022-11-02 21:06:51,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 191 transitions, 420 flow [2022-11-02 21:06:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:51,479 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:51,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:51,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,484 INFO L175 Difference]: Start difference. First operand has 198 places, 192 transitions, 394 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:51,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 191 transitions, 420 flow [2022-11-02 21:06:51,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 191 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:51,488 INFO L231 Difference]: Finished difference. Result has 197 places, 191 transitions, 392 flow [2022-11-02 21:06:51,488 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=197, PETRI_TRANSITIONS=191} [2022-11-02 21:06:51,489 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -70 predicate places. [2022-11-02 21:06:51,489 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 191 transitions, 392 flow [2022-11-02 21:06:51,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:51,490 INFO L208 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-02 21:06:51,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:06:51,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash 446367273, now seen corresponding path program 1 times [2022-11-02 21:06:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:51,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953786901] [2022-11-02 21:06:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:51,530 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-02 21:06:51,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:51,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953786901] [2022-11-02 21:06:51,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953786901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:51,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:51,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026565050] [2022-11-02 21:06:51,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:51,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:51,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:51,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:51,534 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:51,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 191 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:51,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:51,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:51,641 INFO L130 PetriNetUnfolder]: 15/241 cut-off events. [2022-11-02 21:06:51,641 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:51,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 241 events. 15/241 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 227 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 181. Up to 40 conditions per place. [2022-11-02 21:06:51,642 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-02 21:06:51,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 190 transitions, 418 flow [2022-11-02 21:06:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:51,645 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:51,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:51,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:51,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,649 INFO L175 Difference]: Start difference. First operand has 197 places, 191 transitions, 392 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:51,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 190 transitions, 418 flow [2022-11-02 21:06:51,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 190 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:51,653 INFO L231 Difference]: Finished difference. Result has 196 places, 190 transitions, 390 flow [2022-11-02 21:06:51,653 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=196, PETRI_TRANSITIONS=190} [2022-11-02 21:06:51,655 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -71 predicate places. [2022-11-02 21:06:51,655 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 190 transitions, 390 flow [2022-11-02 21:06:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:51,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:51,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:51,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:06:51,656 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1499433076, now seen corresponding path program 1 times [2022-11-02 21:06:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:51,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466533829] [2022-11-02 21:06:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:52,168 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-02 21:06:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:52,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466533829] [2022-11-02 21:06:52,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466533829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:52,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:52,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:06:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597178835] [2022-11-02 21:06:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:52,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:52,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:52,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:52,178 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 284 [2022-11-02 21:06:52,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 190 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:52,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:52,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 284 [2022-11-02 21:06:52,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:52,593 INFO L130 PetriNetUnfolder]: 117/422 cut-off events. [2022-11-02 21:06:52,593 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:06:52,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 422 events. 117/422 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 807 event pairs, 22 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 538. Up to 118 conditions per place. [2022-11-02 21:06:52,596 INFO L137 encePairwiseOnDemand]: 279/284 looper letters, 38 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-02 21:06:52,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 201 transitions, 496 flow [2022-11-02 21:06:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:06:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:06:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1207 transitions. [2022-11-02 21:06:52,600 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-11-02 21:06:52,600 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1207 transitions. [2022-11-02 21:06:52,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1207 transitions. [2022-11-02 21:06:52,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:52,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1207 transitions. [2022-11-02 21:06:52,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.16666666666666) internal successors, (1207), 6 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:52,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:52,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:52,610 INFO L175 Difference]: Start difference. First operand has 196 places, 190 transitions, 390 flow. Second operand 6 states and 1207 transitions. [2022-11-02 21:06:52,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 201 transitions, 496 flow [2022-11-02 21:06:52,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 201 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:06:52,615 INFO L231 Difference]: Finished difference. Result has 198 places, 189 transitions, 392 flow [2022-11-02 21:06:52,616 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=198, PETRI_TRANSITIONS=189} [2022-11-02 21:06:52,616 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -69 predicate places. [2022-11-02 21:06:52,616 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 189 transitions, 392 flow [2022-11-02 21:06:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:52,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:52,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:52,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:06:52,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 162873092, now seen corresponding path program 1 times [2022-11-02 21:06:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:52,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139121464] [2022-11-02 21:06:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:53,306 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-02 21:06:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:53,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139121464] [2022-11-02 21:06:53,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139121464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:53,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:53,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:06:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407039878] [2022-11-02 21:06:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:53,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:53,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:53,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:53,310 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 284 [2022-11-02 21:06:53,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 189 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 197.16666666666666) internal successors, (1183), 6 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:53,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:53,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 284 [2022-11-02 21:06:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:53,655 INFO L130 PetriNetUnfolder]: 106/405 cut-off events. [2022-11-02 21:06:53,655 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 21:06:53,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 405 events. 106/405 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 722 event pairs, 79 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 220. Up to 146 conditions per place. [2022-11-02 21:06:53,657 INFO L137 encePairwiseOnDemand]: 279/284 looper letters, 33 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2022-11-02 21:06:53,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 196 transitions, 480 flow [2022-11-02 21:06:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:06:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:06:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1202 transitions. [2022-11-02 21:06:53,661 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7053990610328639 [2022-11-02 21:06:53,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1202 transitions. [2022-11-02 21:06:53,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1202 transitions. [2022-11-02 21:06:53,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:53,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1202 transitions. [2022-11-02 21:06:53,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:53,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:53,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:53,669 INFO L175 Difference]: Start difference. First operand has 198 places, 189 transitions, 392 flow. Second operand 6 states and 1202 transitions. [2022-11-02 21:06:53,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 196 transitions, 480 flow [2022-11-02 21:06:53,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 196 transitions, 473 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:06:53,673 INFO L231 Difference]: Finished difference. Result has 198 places, 188 transitions, 391 flow [2022-11-02 21:06:53,674 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=198, PETRI_TRANSITIONS=188} [2022-11-02 21:06:53,674 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -69 predicate places. [2022-11-02 21:06:53,674 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 188 transitions, 391 flow [2022-11-02 21:06:53,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.16666666666666) internal successors, (1183), 6 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:53,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:53,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:53,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:06:53,676 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:53,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2136490392, now seen corresponding path program 1 times [2022-11-02 21:06:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:53,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526521165] [2022-11-02 21:06:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:54,419 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-02 21:06:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:54,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526521165] [2022-11-02 21:06:54,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526521165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:54,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:54,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:06:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375073329] [2022-11-02 21:06:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:54,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:54,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:54,423 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 284 [2022-11-02 21:06:54,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 188 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:54,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:54,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 284 [2022-11-02 21:06:54,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:54,744 INFO L130 PetriNetUnfolder]: 105/403 cut-off events. [2022-11-02 21:06:54,744 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 21:06:54,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 403 events. 105/403 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 720 event pairs, 100 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 473. Up to 189 conditions per place. [2022-11-02 21:06:54,746 INFO L137 encePairwiseOnDemand]: 279/284 looper letters, 28 selfloop transitions, 4 changer transitions 0/191 dead transitions. [2022-11-02 21:06:54,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 191 transitions, 461 flow [2022-11-02 21:06:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:06:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:06:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2022-11-02 21:06:54,750 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7024647887323944 [2022-11-02 21:06:54,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1197 transitions. [2022-11-02 21:06:54,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1197 transitions. [2022-11-02 21:06:54,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:54,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1197 transitions. [2022-11-02 21:06:54,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:54,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:54,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:54,758 INFO L175 Difference]: Start difference. First operand has 198 places, 188 transitions, 391 flow. Second operand 6 states and 1197 transitions. [2022-11-02 21:06:54,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 191 transitions, 461 flow [2022-11-02 21:06:54,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 191 transitions, 454 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:06:54,763 INFO L231 Difference]: Finished difference. Result has 198 places, 187 transitions, 390 flow [2022-11-02 21:06:54,763 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=198, PETRI_TRANSITIONS=187} [2022-11-02 21:06:54,764 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -69 predicate places. [2022-11-02 21:06:54,764 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 187 transitions, 390 flow [2022-11-02 21:06:54,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:54,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:54,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:54,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:06:54,766 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash -127567467, now seen corresponding path program 1 times [2022-11-02 21:06:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:54,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117575002] [2022-11-02 21:06:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:54,878 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-02 21:06:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:54,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117575002] [2022-11-02 21:06:54,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117575002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:54,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:54,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527591484] [2022-11-02 21:06:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:54,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:54,905 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 284 [2022-11-02 21:06:54,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 187 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:54,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:54,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 284 [2022-11-02 21:06:54,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:55,019 INFO L130 PetriNetUnfolder]: 15/237 cut-off events. [2022-11-02 21:06:55,020 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:55,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 237 events. 15/237 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 253. Up to 37 conditions per place. [2022-11-02 21:06:55,021 INFO L137 encePairwiseOnDemand]: 282/284 looper letters, 10 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2022-11-02 21:06:55,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 186 transitions, 410 flow [2022-11-02 21:06:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-11-02 21:06:55,024 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7711267605633803 [2022-11-02 21:06:55,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 657 transitions. [2022-11-02 21:06:55,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 657 transitions. [2022-11-02 21:06:55,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:55,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 657 transitions. [2022-11-02 21:06:55,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,030 INFO L175 Difference]: Start difference. First operand has 198 places, 187 transitions, 390 flow. Second operand 3 states and 657 transitions. [2022-11-02 21:06:55,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 186 transitions, 410 flow [2022-11-02 21:06:55,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 186 transitions, 403 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:06:55,034 INFO L231 Difference]: Finished difference. Result has 195 places, 186 transitions, 383 flow [2022-11-02 21:06:55,035 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=195, PETRI_TRANSITIONS=186} [2022-11-02 21:06:55,035 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -72 predicate places. [2022-11-02 21:06:55,035 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 186 transitions, 383 flow [2022-11-02 21:06:55,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:55,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:55,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:06:55,037 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash 967419353, now seen corresponding path program 1 times [2022-11-02 21:06:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:55,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666665586] [2022-11-02 21:06:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:55,166 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-02 21:06:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:55,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666665586] [2022-11-02 21:06:55,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666665586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:55,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:55,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104634865] [2022-11-02 21:06:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:55,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:55,169 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:55,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 186 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:55,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:55,259 INFO L130 PetriNetUnfolder]: 15/235 cut-off events. [2022-11-02 21:06:55,259 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:55,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 235 events. 15/235 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 217 event pairs, 15 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 262. Up to 37 conditions per place. [2022-11-02 21:06:55,260 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 12 selfloop transitions, 1 changer transitions 0/184 dead transitions. [2022-11-02 21:06:55,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 184 transitions, 405 flow [2022-11-02 21:06:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2022-11-02 21:06:55,263 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7640845070422535 [2022-11-02 21:06:55,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2022-11-02 21:06:55,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2022-11-02 21:06:55,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:55,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2022-11-02 21:06:55,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,268 INFO L175 Difference]: Start difference. First operand has 195 places, 186 transitions, 383 flow. Second operand 3 states and 651 transitions. [2022-11-02 21:06:55,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 184 transitions, 405 flow [2022-11-02 21:06:55,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 184 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:06:55,272 INFO L231 Difference]: Finished difference. Result has 194 places, 184 transitions, 380 flow [2022-11-02 21:06:55,272 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=194, PETRI_TRANSITIONS=184} [2022-11-02 21:06:55,272 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -73 predicate places. [2022-11-02 21:06:55,272 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 184 transitions, 380 flow [2022-11-02 21:06:55,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:55,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:55,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:06:55,274 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2022-11-02 21:06:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1977122492, now seen corresponding path program 1 times [2022-11-02 21:06:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988016789] [2022-11-02 21:06:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:55,392 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-02 21:06:55,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:55,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988016789] [2022-11-02 21:06:55,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988016789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:55,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:55,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:06:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542770369] [2022-11-02 21:06:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:55,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:06:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:55,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:06:55,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:06:55,395 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2022-11-02 21:06:55,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 184 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:55,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2022-11-02 21:06:55,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:55,476 INFO L130 PetriNetUnfolder]: 15/233 cut-off events. [2022-11-02 21:06:55,476 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-11-02 21:06:55,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 233 events. 15/233 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 271. Up to 37 conditions per place. [2022-11-02 21:06:55,477 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 0 selfloop transitions, 0 changer transitions 182/182 dead transitions. [2022-11-02 21:06:55,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 182 transitions, 400 flow [2022-11-02 21:06:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:06:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:06:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2022-11-02 21:06:55,480 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7629107981220657 [2022-11-02 21:06:55,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2022-11-02 21:06:55,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2022-11-02 21:06:55,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:55,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2022-11-02 21:06:55,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,485 INFO L175 Difference]: Start difference. First operand has 194 places, 184 transitions, 380 flow. Second operand 3 states and 650 transitions. [2022-11-02 21:06:55,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 182 transitions, 400 flow [2022-11-02 21:06:55,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 182 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:06:55,488 INFO L231 Difference]: Finished difference. Result has 193 places, 0 transitions, 0 flow [2022-11-02 21:06:55,488 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=193, PETRI_TRANSITIONS=0} [2022-11-02 21:06:55,488 INFO L287 CegarLoopForPetriNet]: 267 programPoint places, -74 predicate places. [2022-11-02 21:06:55,488 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 0 transitions, 0 flow [2022-11-02 21:06:55,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:55,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (130 of 131 remaining) [2022-11-02 21:06:55,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (129 of 131 remaining) [2022-11-02 21:06:55,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (128 of 131 remaining) [2022-11-02 21:06:55,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (127 of 131 remaining) [2022-11-02 21:06:55,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (126 of 131 remaining) [2022-11-02 21:06:55,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (125 of 131 remaining) [2022-11-02 21:06:55,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (124 of 131 remaining) [2022-11-02 21:06:55,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (123 of 131 remaining) [2022-11-02 21:06:55,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (122 of 131 remaining) [2022-11-02 21:06:55,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (121 of 131 remaining) [2022-11-02 21:06:55,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (120 of 131 remaining) [2022-11-02 21:06:55,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (119 of 131 remaining) [2022-11-02 21:06:55,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (118 of 131 remaining) [2022-11-02 21:06:55,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (117 of 131 remaining) [2022-11-02 21:06:55,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (116 of 131 remaining) [2022-11-02 21:06:55,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (115 of 131 remaining) [2022-11-02 21:06:55,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (114 of 131 remaining) [2022-11-02 21:06:55,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (113 of 131 remaining) [2022-11-02 21:06:55,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (112 of 131 remaining) [2022-11-02 21:06:55,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (111 of 131 remaining) [2022-11-02 21:06:55,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (110 of 131 remaining) [2022-11-02 21:06:55,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (109 of 131 remaining) [2022-11-02 21:06:55,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (108 of 131 remaining) [2022-11-02 21:06:55,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (107 of 131 remaining) [2022-11-02 21:06:55,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (106 of 131 remaining) [2022-11-02 21:06:55,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (105 of 131 remaining) [2022-11-02 21:06:55,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (104 of 131 remaining) [2022-11-02 21:06:55,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 131 remaining) [2022-11-02 21:06:55,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (102 of 131 remaining) [2022-11-02 21:06:55,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (101 of 131 remaining) [2022-11-02 21:06:55,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (100 of 131 remaining) [2022-11-02 21:06:55,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (99 of 131 remaining) [2022-11-02 21:06:55,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (98 of 131 remaining) [2022-11-02 21:06:55,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (97 of 131 remaining) [2022-11-02 21:06:55,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (96 of 131 remaining) [2022-11-02 21:06:55,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (95 of 131 remaining) [2022-11-02 21:06:55,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (94 of 131 remaining) [2022-11-02 21:06:55,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (93 of 131 remaining) [2022-11-02 21:06:55,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (92 of 131 remaining) [2022-11-02 21:06:55,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (91 of 131 remaining) [2022-11-02 21:06:55,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (90 of 131 remaining) [2022-11-02 21:06:55,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (89 of 131 remaining) [2022-11-02 21:06:55,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (88 of 131 remaining) [2022-11-02 21:06:55,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (87 of 131 remaining) [2022-11-02 21:06:55,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (86 of 131 remaining) [2022-11-02 21:06:55,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (85 of 131 remaining) [2022-11-02 21:06:55,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 131 remaining) [2022-11-02 21:06:55,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (83 of 131 remaining) [2022-11-02 21:06:55,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (82 of 131 remaining) [2022-11-02 21:06:55,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (81 of 131 remaining) [2022-11-02 21:06:55,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (80 of 131 remaining) [2022-11-02 21:06:55,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (79 of 131 remaining) [2022-11-02 21:06:55,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (78 of 131 remaining) [2022-11-02 21:06:55,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (77 of 131 remaining) [2022-11-02 21:06:55,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (76 of 131 remaining) [2022-11-02 21:06:55,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (75 of 131 remaining) [2022-11-02 21:06:55,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (74 of 131 remaining) [2022-11-02 21:06:55,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (73 of 131 remaining) [2022-11-02 21:06:55,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (72 of 131 remaining) [2022-11-02 21:06:55,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (71 of 131 remaining) [2022-11-02 21:06:55,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (70 of 131 remaining) [2022-11-02 21:06:55,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (69 of 131 remaining) [2022-11-02 21:06:55,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 131 remaining) [2022-11-02 21:06:55,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (67 of 131 remaining) [2022-11-02 21:06:55,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (66 of 131 remaining) [2022-11-02 21:06:55,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (65 of 131 remaining) [2022-11-02 21:06:55,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (64 of 131 remaining) [2022-11-02 21:06:55,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 131 remaining) [2022-11-02 21:06:55,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (62 of 131 remaining) [2022-11-02 21:06:55,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (61 of 131 remaining) [2022-11-02 21:06:55,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (60 of 131 remaining) [2022-11-02 21:06:55,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (59 of 131 remaining) [2022-11-02 21:06:55,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (58 of 131 remaining) [2022-11-02 21:06:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (57 of 131 remaining) [2022-11-02 21:06:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 131 remaining) [2022-11-02 21:06:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 131 remaining) [2022-11-02 21:06:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 131 remaining) [2022-11-02 21:06:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 131 remaining) [2022-11-02 21:06:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (52 of 131 remaining) [2022-11-02 21:06:55,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 131 remaining) [2022-11-02 21:06:55,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 131 remaining) [2022-11-02 21:06:55,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 131 remaining) [2022-11-02 21:06:55,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 131 remaining) [2022-11-02 21:06:55,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 131 remaining) [2022-11-02 21:06:55,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 131 remaining) [2022-11-02 21:06:55,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 131 remaining) [2022-11-02 21:06:55,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 131 remaining) [2022-11-02 21:06:55,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (43 of 131 remaining) [2022-11-02 21:06:55,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 131 remaining) [2022-11-02 21:06:55,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (41 of 131 remaining) [2022-11-02 21:06:55,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (40 of 131 remaining) [2022-11-02 21:06:55,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (39 of 131 remaining) [2022-11-02 21:06:55,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 131 remaining) [2022-11-02 21:06:55,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (37 of 131 remaining) [2022-11-02 21:06:55,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 131 remaining) [2022-11-02 21:06:55,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 131 remaining) [2022-11-02 21:06:55,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 131 remaining) [2022-11-02 21:06:55,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 131 remaining) [2022-11-02 21:06:55,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 131 remaining) [2022-11-02 21:06:55,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 131 remaining) [2022-11-02 21:06:55,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 131 remaining) [2022-11-02 21:06:55,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 131 remaining) [2022-11-02 21:06:55,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 131 remaining) [2022-11-02 21:06:55,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 131 remaining) [2022-11-02 21:06:55,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 131 remaining) [2022-11-02 21:06:55,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (25 of 131 remaining) [2022-11-02 21:06:55,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 131 remaining) [2022-11-02 21:06:55,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 131 remaining) [2022-11-02 21:06:55,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 131 remaining) [2022-11-02 21:06:55,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (21 of 131 remaining) [2022-11-02 21:06:55,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (20 of 131 remaining) [2022-11-02 21:06:55,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (19 of 131 remaining) [2022-11-02 21:06:55,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 131 remaining) [2022-11-02 21:06:55,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 131 remaining) [2022-11-02 21:06:55,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 131 remaining) [2022-11-02 21:06:55,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 131 remaining) [2022-11-02 21:06:55,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 131 remaining) [2022-11-02 21:06:55,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 131 remaining) [2022-11-02 21:06:55,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 131 remaining) [2022-11-02 21:06:55,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 131 remaining) [2022-11-02 21:06:55,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 131 remaining) [2022-11-02 21:06:55,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 131 remaining) [2022-11-02 21:06:55,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (8 of 131 remaining) [2022-11-02 21:06:55,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 131 remaining) [2022-11-02 21:06:55,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 131 remaining) [2022-11-02 21:06:55,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 131 remaining) [2022-11-02 21:06:55,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 131 remaining) [2022-11-02 21:06:55,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 131 remaining) [2022-11-02 21:06:55,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 131 remaining) [2022-11-02 21:06:55,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 131 remaining) [2022-11-02 21:06:55,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 131 remaining) [2022-11-02 21:06:55,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:06:55,517 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:55,523 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 21:06:55,523 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:06:55,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:06:55 BasicIcfg [2022-11-02 21:06:55,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:06:55,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:06:55,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:06:55,529 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:06:55,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:06:48" (3/4) ... [2022-11-02 21:06:55,531 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:06:55,536 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 21:06:55,536 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 21:06:55,536 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 21:06:55,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-02 21:06:55,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 21:06:55,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 21:06:55,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:06:55,585 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:06:55,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:06:55,586 INFO L158 Benchmark]: Toolchain (without parser) took 10131.51ms. Allocated memory was 109.1MB in the beginning and 413.1MB in the end (delta: 304.1MB). Free memory was 79.8MB in the beginning and 158.7MB in the end (delta: -78.9MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,586 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:06:55,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.35ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 79.8MB in the beginning and 106.5MB in the end (delta: -26.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.47ms. Allocated memory is still 134.2MB. Free memory was 106.5MB in the beginning and 102.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,587 INFO L158 Benchmark]: Boogie Preprocessor took 82.39ms. Allocated memory is still 134.2MB. Free memory was 102.6MB in the beginning and 100.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,588 INFO L158 Benchmark]: RCFGBuilder took 2210.50ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 99.8MB in the beginning and 92.1MB in the end (delta: 7.7MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,588 INFO L158 Benchmark]: TraceAbstraction took 7268.40ms. Allocated memory was 161.5MB in the beginning and 413.1MB in the end (delta: 251.7MB). Free memory was 92.1MB in the beginning and 162.8MB in the end (delta: -70.7MB). Peak memory consumption was 179.9MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,589 INFO L158 Benchmark]: Witness Printer took 57.26ms. Allocated memory is still 413.1MB. Free memory was 162.8MB in the beginning and 158.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:06:55,591 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.21ms. Allocated memory is still 109.1MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.35ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 79.8MB in the beginning and 106.5MB in the end (delta: -26.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.47ms. Allocated memory is still 134.2MB. Free memory was 106.5MB in the beginning and 102.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.39ms. Allocated memory is still 134.2MB. Free memory was 102.6MB in the beginning and 100.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2210.50ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 99.8MB in the beginning and 92.1MB in the end (delta: 7.7MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7268.40ms. Allocated memory was 161.5MB in the beginning and 413.1MB in the end (delta: 251.7MB). Free memory was 92.1MB in the beginning and 162.8MB in the end (delta: -70.7MB). Peak memory consumption was 179.9MB. Max. memory is 16.1GB. * Witness Printer took 57.26ms. Allocated memory is still 413.1MB. Free memory was 162.8MB in the beginning and 158.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 56]: 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: 56]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 88]: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: 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, 351 locations, 131 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: 7.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 559 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 83 mSDtfsCounter, 559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=0, InterpolantAutomatonStates: 63, 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.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1848 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1830 ConstructedInterpolants, 0 QuantifiedInterpolants, 2103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 74 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 21:06:55,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b6cbb87-3472-4b62-89bd-261c4e769c00/bin/uautomizer-Dbtcem3rbc/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