./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/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_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/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_928be58e-f00b-43c9-8113-863b35b0dc4e/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 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 --- 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 20:35:39,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:35:39,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:35:39,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:35:39,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:35:39,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:35:39,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:35:39,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:35:39,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:35:39,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:35:39,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:35:39,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:35:39,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:35:39,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:35:39,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:35:39,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:35:39,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:35:39,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:35:39,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:35:39,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:35:39,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:35:39,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:35:39,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:35:39,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:35:39,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:35:39,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:35:39,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:35:39,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:35:39,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:35:39,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:35:39,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:35:39,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:35:39,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:35:39,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:35:39,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:35:39,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:35:39,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:35:39,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:35:39,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:35:39,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:35:39,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:35:39,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:35:39,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:35:39,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:35:39,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:35:39,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:35:39,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:35:39,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:35:39,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:35:39,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:35:39,445 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:35:39,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:35:39,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:35:39,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:35:39,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:35:39,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:35:39,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:35:39,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:35:39,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:35:39,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:35:39,450 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:35:39,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:35:39,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:35:39,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:35:39,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:35:39,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:35:39,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:35:39,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:35:39,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:39,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:35:39,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:35:39,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:35:39,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:35:39,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:35:39,454 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:35:39,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:35:39,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:35:39,455 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_928be58e-f00b-43c9-8113-863b35b0dc4e/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_928be58e-f00b-43c9-8113-863b35b0dc4e/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 -> 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 [2022-11-02 20:35:39,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:35:39,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:35:39,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:35:39,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:35:39,861 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:35:39,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2022-11-02 20:35:39,964 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/data/f5d6cdaf1/59995ad7bd7b45caadf5096cefb6bdcd/FLAG52e3cf641 [2022-11-02 20:35:40,719 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:35:40,720 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2022-11-02 20:35:40,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/data/f5d6cdaf1/59995ad7bd7b45caadf5096cefb6bdcd/FLAG52e3cf641 [2022-11-02 20:35:41,025 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/data/f5d6cdaf1/59995ad7bd7b45caadf5096cefb6bdcd [2022-11-02 20:35:41,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:35:41,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:35:41,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:41,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:35:41,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:35:41,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d41d651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41, skipping insertion in model container [2022-11-02 20:35:41,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:35:41,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:35:41,537 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_928be58e-f00b-43c9-8113-863b35b0dc4e/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2022-11-02 20:35:41,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:41,568 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:35:41,635 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_928be58e-f00b-43c9-8113-863b35b0dc4e/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2022-11-02 20:35:41,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:41,683 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:35:41,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41 WrapperNode [2022-11-02 20:35:41,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:41,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:41,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:35:41,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:35:41,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,782 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 680 [2022-11-02 20:35:41,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:41,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:35:41,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:35:41,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:35:41,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,844 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:35:41,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:35:41,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:35:41,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:35:41,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (1/1) ... [2022-11-02 20:35:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:41,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:41,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:41,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:35:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:35:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:35:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:35:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:35:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:35:41,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:35:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:35:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:35:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:35:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:35:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:35:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:35:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:35:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:35:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:35:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:35:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:35:41,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:35:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:35:41,965 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 20:35:42,166 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:35:42,169 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:35:43,684 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:35:44,429 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:35:44,430 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-02 20:35:44,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:44 BoogieIcfgContainer [2022-11-02 20:35:44,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:35:44,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:35:44,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:35:44,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:35:44,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:35:41" (1/3) ... [2022-11-02 20:35:44,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3632d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:44, skipping insertion in model container [2022-11-02 20:35:44,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:41" (2/3) ... [2022-11-02 20:35:44,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3632d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:44, skipping insertion in model container [2022-11-02 20:35:44,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:44" (3/3) ... [2022-11-02 20:35:44,451 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2022-11-02 20:35:44,463 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:35:44,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:35:44,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2022-11-02 20:35:44,477 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:35:44,771 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:35:44,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 455 places, 464 transitions, 960 flow [2022-11-02 20:35:45,056 INFO L130 PetriNetUnfolder]: 22/460 cut-off events. [2022-11-02 20:35:45,056 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:35:45,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 460 events. 22/460 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 667 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 375. Up to 2 conditions per place. [2022-11-02 20:35:45,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 455 places, 464 transitions, 960 flow [2022-11-02 20:35:45,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 438 transitions, 900 flow [2022-11-02 20:35:45,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:35:45,100 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;@2f54a8ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:35:45,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 186 error locations. [2022-11-02 20:35:45,107 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-11-02 20:35:45,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:35:45,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:45,108 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] [2022-11-02 20:35:45,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash 441863542, now seen corresponding path program 1 times [2022-11-02 20:35:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:45,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094785239] [2022-11-02 20:35:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:45,395 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 20:35:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:45,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094785239] [2022-11-02 20:35:45,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094785239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:45,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:45,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011020704] [2022-11-02 20:35:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:45,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:45,452 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 464 [2022-11-02 20:35:45,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 438 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states 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 20:35:45,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:45,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 464 [2022-11-02 20:35:45,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:46,691 INFO L130 PetriNetUnfolder]: 745/1781 cut-off events. [2022-11-02 20:35:46,691 INFO L131 PetriNetUnfolder]: For 293/399 co-relation queries the response was YES. [2022-11-02 20:35:46,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 1781 events. 745/1781 cut-off events. For 293/399 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9188 event pairs, 485 based on Foata normal form. 267/1818 useless extension candidates. Maximal degree in co-relation 2559. Up to 1013 conditions per place. [2022-11-02 20:35:46,715 INFO L137 encePairwiseOnDemand]: 368/464 looper letters, 31 selfloop transitions, 2 changer transitions 7/344 dead transitions. [2022-11-02 20:35:46,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 344 transitions, 778 flow [2022-11-02 20:35:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1132 transitions. [2022-11-02 20:35:46,736 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2022-11-02 20:35:46,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1132 transitions. [2022-11-02 20:35:46,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1132 transitions. [2022-11-02 20:35:46,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:46,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1132 transitions. [2022-11-02 20:35:46,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states 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 20:35:46,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:46,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:46,767 INFO L175 Difference]: Start difference. First operand has 430 places, 438 transitions, 900 flow. Second operand 3 states and 1132 transitions. [2022-11-02 20:35:46,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 344 transitions, 778 flow [2022-11-02 20:35:46,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 344 transitions, 762 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:35:46,783 INFO L231 Difference]: Finished difference. Result has 344 places, 337 transitions, 686 flow [2022-11-02 20:35:46,786 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=344, PETRI_TRANSITIONS=337} [2022-11-02 20:35:46,791 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -86 predicate places. [2022-11-02 20:35:46,791 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 337 transitions, 686 flow [2022-11-02 20:35:46,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states 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 20:35:46,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:46,793 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] [2022-11-02 20:35:46,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:35:46,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash -584074418, now seen corresponding path program 1 times [2022-11-02 20:35:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:46,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425475270] [2022-11-02 20:35:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:46,892 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 20:35:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:46,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425475270] [2022-11-02 20:35:46,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425475270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:46,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:46,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:46,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516485978] [2022-11-02 20:35:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:46,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:46,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:46,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:46,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:46,898 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 464 [2022-11-02 20:35:46,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 337 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:46,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:46,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 464 [2022-11-02 20:35:46,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:48,065 INFO L130 PetriNetUnfolder]: 745/1773 cut-off events. [2022-11-02 20:35:48,066 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:35:48,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2858 conditions, 1773 events. 745/1773 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9193 event pairs, 485 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 2816. Up to 1010 conditions per place. [2022-11-02 20:35:48,086 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 28 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2022-11-02 20:35:48,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 336 transitions, 744 flow [2022-11-02 20:35:48,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2022-11-02 20:35:48,090 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7507183908045977 [2022-11-02 20:35:48,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2022-11-02 20:35:48,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2022-11-02 20:35:48,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:48,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2022-11-02 20:35:48,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 20:35:48,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:48,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:48,103 INFO L175 Difference]: Start difference. First operand has 344 places, 337 transitions, 686 flow. Second operand 3 states and 1045 transitions. [2022-11-02 20:35:48,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 336 transitions, 744 flow [2022-11-02 20:35:48,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 336 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:48,119 INFO L231 Difference]: Finished difference. Result has 336 places, 336 transitions, 684 flow [2022-11-02 20:35:48,121 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=336, PETRI_TRANSITIONS=336} [2022-11-02 20:35:48,122 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -94 predicate places. [2022-11-02 20:35:48,123 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 336 transitions, 684 flow [2022-11-02 20:35:48,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:48,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:48,124 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] [2022-11-02 20:35:48,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:35:48,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1774840974, now seen corresponding path program 1 times [2022-11-02 20:35:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:48,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128590089] [2022-11-02 20:35:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:48,302 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 20:35:48,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:48,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128590089] [2022-11-02 20:35:48,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128590089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:48,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:48,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677168633] [2022-11-02 20:35:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:48,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:48,308 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 464 [2022-11-02 20:35:48,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 336 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:48,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:48,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 464 [2022-11-02 20:35:48,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:49,196 INFO L130 PetriNetUnfolder]: 745/1772 cut-off events. [2022-11-02 20:35:49,197 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:35:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 1772 events. 745/1772 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9210 event pairs, 485 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 2808. Up to 1010 conditions per place. [2022-11-02 20:35:49,217 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 28 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2022-11-02 20:35:49,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 335 transitions, 742 flow [2022-11-02 20:35:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2022-11-02 20:35:49,223 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7507183908045977 [2022-11-02 20:35:49,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2022-11-02 20:35:49,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2022-11-02 20:35:49,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:49,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2022-11-02 20:35:49,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 20:35:49,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:49,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:49,234 INFO L175 Difference]: Start difference. First operand has 336 places, 336 transitions, 684 flow. Second operand 3 states and 1045 transitions. [2022-11-02 20:35:49,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 335 transitions, 742 flow [2022-11-02 20:35:49,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 335 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:49,243 INFO L231 Difference]: Finished difference. Result has 335 places, 335 transitions, 682 flow [2022-11-02 20:35:49,244 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=335, PETRI_TRANSITIONS=335} [2022-11-02 20:35:49,248 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -95 predicate places. [2022-11-02 20:35:49,248 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 335 transitions, 682 flow [2022-11-02 20:35:49,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:49,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:49,250 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] [2022-11-02 20:35:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:35:49,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:49,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash -160298713, now seen corresponding path program 1 times [2022-11-02 20:35:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:49,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183087020] [2022-11-02 20:35:49,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,396 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 20:35:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183087020] [2022-11-02 20:35:49,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183087020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:49,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:49,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583758029] [2022-11-02 20:35:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:49,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:49,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:49,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,401 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 464 [2022-11-02 20:35:49,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 335 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:49,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:49,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 464 [2022-11-02 20:35:49,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:50,274 INFO L130 PetriNetUnfolder]: 745/1771 cut-off events. [2022-11-02 20:35:50,274 INFO L131 PetriNetUnfolder]: For 49/155 co-relation queries the response was YES. [2022-11-02 20:35:50,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1771 events. 745/1771 cut-off events. For 49/155 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9165 event pairs, 485 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 2800. Up to 1010 conditions per place. [2022-11-02 20:35:50,294 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 28 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2022-11-02 20:35:50,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 334 transitions, 740 flow [2022-11-02 20:35:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2022-11-02 20:35:50,300 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7507183908045977 [2022-11-02 20:35:50,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2022-11-02 20:35:50,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2022-11-02 20:35:50,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:50,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2022-11-02 20:35:50,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 20:35:50,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:50,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:50,321 INFO L175 Difference]: Start difference. First operand has 335 places, 335 transitions, 682 flow. Second operand 3 states and 1045 transitions. [2022-11-02 20:35:50,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 334 transitions, 740 flow [2022-11-02 20:35:50,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 334 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:50,331 INFO L231 Difference]: Finished difference. Result has 334 places, 334 transitions, 680 flow [2022-11-02 20:35:50,332 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=334, PETRI_TRANSITIONS=334} [2022-11-02 20:35:50,334 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -96 predicate places. [2022-11-02 20:35:50,335 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 334 transitions, 680 flow [2022-11-02 20:35:50,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:50,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:50,337 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] [2022-11-02 20:35:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:35:50,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash -230849971, now seen corresponding path program 1 times [2022-11-02 20:35:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:50,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141935567] [2022-11-02 20:35:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,473 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 20:35:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:50,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141935567] [2022-11-02 20:35:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141935567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:50,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:50,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026994235] [2022-11-02 20:35:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:50,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:50,481 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:35:50,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 334 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:50,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:50,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:35:50,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:51,788 INFO L130 PetriNetUnfolder]: 982/2602 cut-off events. [2022-11-02 20:35:51,789 INFO L131 PetriNetUnfolder]: For 69/151 co-relation queries the response was YES. [2022-11-02 20:35:51,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 2602 events. 982/2602 cut-off events. For 69/151 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 16569 event pairs, 392 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 3955. Up to 715 conditions per place. [2022-11-02 20:35:51,814 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 41 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2022-11-02 20:35:51,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 350 transitions, 803 flow [2022-11-02 20:35:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1067 transitions. [2022-11-02 20:35:51,819 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7665229885057471 [2022-11-02 20:35:51,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1067 transitions. [2022-11-02 20:35:51,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1067 transitions. [2022-11-02 20:35:51,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:51,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1067 transitions. [2022-11-02 20:35:51,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 355.6666666666667) internal successors, (1067), 3 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 20:35:51,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:51,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:51,830 INFO L175 Difference]: Start difference. First operand has 334 places, 334 transitions, 680 flow. Second operand 3 states and 1067 transitions. [2022-11-02 20:35:51,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 350 transitions, 803 flow [2022-11-02 20:35:51,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 350 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:51,839 INFO L231 Difference]: Finished difference. Result has 334 places, 334 transitions, 684 flow [2022-11-02 20:35:51,840 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=334, PETRI_TRANSITIONS=334} [2022-11-02 20:35:51,841 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -96 predicate places. [2022-11-02 20:35:51,841 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 334 transitions, 684 flow [2022-11-02 20:35:51,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:51,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:51,843 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 20:35:51,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:35:51,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1148954811, now seen corresponding path program 1 times [2022-11-02 20:35:51,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:51,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096780286] [2022-11-02 20:35:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:51,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,901 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 20:35:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:51,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096780286] [2022-11-02 20:35:51,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096780286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:51,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:51,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701151569] [2022-11-02 20:35:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:51,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:51,906 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:35:51,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 334 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:51,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:51,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:35:51,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:53,000 INFO L130 PetriNetUnfolder]: 982/2336 cut-off events. [2022-11-02 20:35:53,001 INFO L131 PetriNetUnfolder]: For 227/364 co-relation queries the response was YES. [2022-11-02 20:35:53,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3991 conditions, 2336 events. 982/2336 cut-off events. For 227/364 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13894 event pairs, 665 based on Foata normal form. 0/2044 useless extension candidates. Maximal degree in co-relation 2084. Up to 1327 conditions per place. [2022-11-02 20:35:53,027 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 26 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2022-11-02 20:35:53,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 333 transitions, 738 flow [2022-11-02 20:35:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2022-11-02 20:35:53,031 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550287356321839 [2022-11-02 20:35:53,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2022-11-02 20:35:53,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2022-11-02 20:35:53,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:53,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2022-11-02 20:35:53,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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 20:35:53,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:53,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:53,042 INFO L175 Difference]: Start difference. First operand has 334 places, 334 transitions, 684 flow. Second operand 3 states and 1051 transitions. [2022-11-02 20:35:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 333 transitions, 738 flow [2022-11-02 20:35:53,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 333 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:53,055 INFO L231 Difference]: Finished difference. Result has 334 places, 333 transitions, 684 flow [2022-11-02 20:35:53,056 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=334, PETRI_TRANSITIONS=333} [2022-11-02 20:35:53,059 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -96 predicate places. [2022-11-02 20:35:53,062 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 333 transitions, 684 flow [2022-11-02 20:35:53,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:53,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:53,065 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] [2022-11-02 20:35:53,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:35:53,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:53,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1697304329, now seen corresponding path program 1 times [2022-11-02 20:35:53,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:53,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754203492] [2022-11-02 20:35:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:53,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:53,136 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 20:35:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754203492] [2022-11-02 20:35:53,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754203492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:53,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:53,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971017639] [2022-11-02 20:35:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:53,142 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 464 [2022-11-02 20:35:53,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 333 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:53,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:53,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 464 [2022-11-02 20:35:53,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:54,138 INFO L130 PetriNetUnfolder]: 982/2335 cut-off events. [2022-11-02 20:35:54,139 INFO L131 PetriNetUnfolder]: For 226/363 co-relation queries the response was YES. [2022-11-02 20:35:54,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 2335 events. 982/2335 cut-off events. For 226/363 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13891 event pairs, 665 based on Foata normal form. 0/2044 useless extension candidates. Maximal degree in co-relation 3844. Up to 1330 conditions per place. [2022-11-02 20:35:54,164 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 29 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2022-11-02 20:35:54,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 332 transitions, 744 flow [2022-11-02 20:35:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2022-11-02 20:35:54,169 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7507183908045977 [2022-11-02 20:35:54,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1045 transitions. [2022-11-02 20:35:54,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1045 transitions. [2022-11-02 20:35:54,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:54,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1045 transitions. [2022-11-02 20:35:54,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 20:35:54,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:54,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:54,177 INFO L175 Difference]: Start difference. First operand has 334 places, 333 transitions, 684 flow. Second operand 3 states and 1045 transitions. [2022-11-02 20:35:54,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 332 transitions, 744 flow [2022-11-02 20:35:54,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 332 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:54,187 INFO L231 Difference]: Finished difference. Result has 333 places, 332 transitions, 682 flow [2022-11-02 20:35:54,188 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=333, PETRI_TRANSITIONS=332} [2022-11-02 20:35:54,189 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -97 predicate places. [2022-11-02 20:35:54,190 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 332 transitions, 682 flow [2022-11-02 20:35:54,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:35:54,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:54,191 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] [2022-11-02 20:35:54,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:35:54,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -576210700, now seen corresponding path program 1 times [2022-11-02 20:35:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:54,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641525379] [2022-11-02 20:35:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,286 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 20:35:54,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:54,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641525379] [2022-11-02 20:35:54,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641525379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:54,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:54,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620177936] [2022-11-02 20:35:54,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:54,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:54,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:54,293 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:35:54,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 332 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:54,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:54,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:35:54,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:55,619 INFO L130 PetriNetUnfolder]: 1232/3022 cut-off events. [2022-11-02 20:35:55,619 INFO L131 PetriNetUnfolder]: For 293/461 co-relation queries the response was YES. [2022-11-02 20:35:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 3022 events. 1232/3022 cut-off events. For 293/461 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20118 event pairs, 472 based on Foata normal form. 0/2640 useless extension candidates. Maximal degree in co-relation 4899. Up to 903 conditions per place. [2022-11-02 20:35:55,660 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 42 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2022-11-02 20:35:55,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 348 transitions, 810 flow [2022-11-02 20:35:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1066 transitions. [2022-11-02 20:35:55,666 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7658045977011494 [2022-11-02 20:35:55,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1066 transitions. [2022-11-02 20:35:55,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1066 transitions. [2022-11-02 20:35:55,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:55,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1066 transitions. [2022-11-02 20:35:55,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 20:35:55,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:55,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:55,677 INFO L175 Difference]: Start difference. First operand has 333 places, 332 transitions, 682 flow. Second operand 3 states and 1066 transitions. [2022-11-02 20:35:55,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 348 transitions, 810 flow [2022-11-02 20:35:55,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 348 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:55,687 INFO L231 Difference]: Finished difference. Result has 333 places, 332 transitions, 686 flow [2022-11-02 20:35:55,687 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=333, PETRI_TRANSITIONS=332} [2022-11-02 20:35:55,688 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -97 predicate places. [2022-11-02 20:35:55,689 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 332 transitions, 686 flow [2022-11-02 20:35:55,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:55,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:55,690 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 20:35:55,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:35:55,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -463291879, now seen corresponding path program 1 times [2022-11-02 20:35:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:55,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322980272] [2022-11-02 20:35:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:55,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:55,779 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 20:35:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:55,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322980272] [2022-11-02 20:35:55,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322980272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:55,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:55,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926223118] [2022-11-02 20:35:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:55,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:55,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:55,787 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:35:55,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 332 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:55,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:55,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:35:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:57,037 INFO L130 PetriNetUnfolder]: 1232/3021 cut-off events. [2022-11-02 20:35:57,037 INFO L131 PetriNetUnfolder]: For 465/633 co-relation queries the response was YES. [2022-11-02 20:35:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5237 conditions, 3021 events. 1232/3021 cut-off events. For 465/633 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20129 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 3028. Up to 1665 conditions per place. [2022-11-02 20:35:57,075 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 27 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2022-11-02 20:35:57,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 331 transitions, 742 flow [2022-11-02 20:35:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2022-11-02 20:35:57,080 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550287356321839 [2022-11-02 20:35:57,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2022-11-02 20:35:57,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2022-11-02 20:35:57,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:57,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2022-11-02 20:35:57,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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 20:35:57,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:57,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:57,090 INFO L175 Difference]: Start difference. First operand has 333 places, 332 transitions, 686 flow. Second operand 3 states and 1051 transitions. [2022-11-02 20:35:57,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 331 transitions, 742 flow [2022-11-02 20:35:57,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 331 transitions, 740 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:57,101 INFO L231 Difference]: Finished difference. Result has 333 places, 331 transitions, 686 flow [2022-11-02 20:35:57,102 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=333, PETRI_TRANSITIONS=331} [2022-11-02 20:35:57,103 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -97 predicate places. [2022-11-02 20:35:57,103 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 331 transitions, 686 flow [2022-11-02 20:35:57,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:57,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:57,104 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] [2022-11-02 20:35:57,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:35:57,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2098547627, now seen corresponding path program 1 times [2022-11-02 20:35:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:57,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16510867] [2022-11-02 20:35:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:57,161 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 20:35:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:57,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16510867] [2022-11-02 20:35:57,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16510867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:57,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:57,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927719025] [2022-11-02 20:35:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:57,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:57,167 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:35:57,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 331 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:57,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:57,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:35:57,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:58,205 INFO L130 PetriNetUnfolder]: 1232/3020 cut-off events. [2022-11-02 20:35:58,205 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:35:58,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 3020 events. 1232/3020 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20179 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 5062. Up to 1663 conditions per place. [2022-11-02 20:35:58,234 INFO L137 encePairwiseOnDemand]: 462/464 looper letters, 27 selfloop transitions, 1 changer transitions 0/330 dead transitions. [2022-11-02 20:35:58,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 330 transitions, 740 flow [2022-11-02 20:35:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2022-11-02 20:35:58,239 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7543103448275862 [2022-11-02 20:35:58,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2022-11-02 20:35:58,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2022-11-02 20:35:58,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:58,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2022-11-02 20:35:58,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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 20:35:58,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:58,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:58,247 INFO L175 Difference]: Start difference. First operand has 333 places, 331 transitions, 686 flow. Second operand 3 states and 1050 transitions. [2022-11-02 20:35:58,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 330 transitions, 740 flow [2022-11-02 20:35:58,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 330 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:58,255 INFO L231 Difference]: Finished difference. Result has 332 places, 330 transitions, 682 flow [2022-11-02 20:35:58,256 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=332, PETRI_TRANSITIONS=330} [2022-11-02 20:35:58,257 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -98 predicate places. [2022-11-02 20:35:58,257 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 330 transitions, 682 flow [2022-11-02 20:35:58,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:58,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:58,259 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] [2022-11-02 20:35:58,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:35:58,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:58,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1102478678, now seen corresponding path program 1 times [2022-11-02 20:35:58,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:58,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876161827] [2022-11-02 20:35:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,320 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 20:35:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:58,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876161827] [2022-11-02 20:35:58,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876161827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:58,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:58,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160192275] [2022-11-02 20:35:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:58,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:58,325 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:35:58,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 330 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:58,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:58,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:35:58,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:59,322 INFO L130 PetriNetUnfolder]: 1232/3019 cut-off events. [2022-11-02 20:35:59,322 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:35:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5150 conditions, 3019 events. 1232/3019 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20083 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 5062. Up to 1665 conditions per place. [2022-11-02 20:35:59,354 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 27 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-02 20:35:59,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 329 transitions, 738 flow [2022-11-02 20:35:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2022-11-02 20:35:59,358 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550287356321839 [2022-11-02 20:35:59,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2022-11-02 20:35:59,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2022-11-02 20:35:59,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:59,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2022-11-02 20:35:59,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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 20:35:59,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:59,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:35:59,368 INFO L175 Difference]: Start difference. First operand has 332 places, 330 transitions, 682 flow. Second operand 3 states and 1051 transitions. [2022-11-02 20:35:59,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 329 transitions, 738 flow [2022-11-02 20:35:59,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 329 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:59,376 INFO L231 Difference]: Finished difference. Result has 332 places, 329 transitions, 683 flow [2022-11-02 20:35:59,377 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=332, PETRI_TRANSITIONS=329} [2022-11-02 20:35:59,378 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -98 predicate places. [2022-11-02 20:35:59,378 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 329 transitions, 683 flow [2022-11-02 20:35:59,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:35:59,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:59,380 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] [2022-11-02 20:35:59,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:35:59,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash -119345028, now seen corresponding path program 1 times [2022-11-02 20:35:59,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:59,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950329415] [2022-11-02 20:35:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:00,053 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 20:36:00,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950329415] [2022-11-02 20:36:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950329415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331943782] [2022-11-02 20:36:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:00,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:00,058 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 464 [2022-11-02 20:36:00,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 329 transitions, 683 flow. Second operand has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states 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 20:36:00,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:00,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 464 [2022-11-02 20:36:00,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:04,869 INFO L130 PetriNetUnfolder]: 8768/13194 cut-off events. [2022-11-02 20:36:04,869 INFO L131 PetriNetUnfolder]: For 2412/2412 co-relation queries the response was YES. [2022-11-02 20:36:04,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27010 conditions, 13194 events. 8768/13194 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 74429 event pairs, 6510 based on Foata normal form. 0/12409 useless extension candidates. Maximal degree in co-relation 26923. Up to 11295 conditions per place. [2022-11-02 20:36:04,976 INFO L137 encePairwiseOnDemand]: 446/464 looper letters, 81 selfloop transitions, 15 changer transitions 0/326 dead transitions. [2022-11-02 20:36:04,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 326 transitions, 869 flow [2022-11-02 20:36:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1729 transitions. [2022-11-02 20:36:04,983 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6210488505747126 [2022-11-02 20:36:04,983 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1729 transitions. [2022-11-02 20:36:04,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1729 transitions. [2022-11-02 20:36:04,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:04,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1729 transitions. [2022-11-02 20:36:04,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 288.1666666666667) internal successors, (1729), 6 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states 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 20:36:05,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:05,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:05,003 INFO L175 Difference]: Start difference. First operand has 332 places, 329 transitions, 683 flow. Second operand 6 states and 1729 transitions. [2022-11-02 20:36:05,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 326 transitions, 869 flow [2022-11-02 20:36:05,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 326 transitions, 865 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:05,015 INFO L231 Difference]: Finished difference. Result has 332 places, 326 transitions, 703 flow [2022-11-02 20:36:05,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=332, PETRI_TRANSITIONS=326} [2022-11-02 20:36:05,019 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -98 predicate places. [2022-11-02 20:36:05,019 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 326 transitions, 703 flow [2022-11-02 20:36:05,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states 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 20:36:05,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:05,020 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] [2022-11-02 20:36:05,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:36:05,021 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1620144800, now seen corresponding path program 1 times [2022-11-02 20:36:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:05,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419116514] [2022-11-02 20:36:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:05,098 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 20:36:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:05,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419116514] [2022-11-02 20:36:05,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419116514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:05,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:05,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022488981] [2022-11-02 20:36:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:05,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:05,102 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:36:05,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 326 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:36:05,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:05,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:36:05,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:06,358 INFO L130 PetriNetUnfolder]: 1232/3015 cut-off events. [2022-11-02 20:36:06,359 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:36:06,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5160 conditions, 3015 events. 1232/3015 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20126 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 5110. Up to 1663 conditions per place. [2022-11-02 20:36:06,381 INFO L137 encePairwiseOnDemand]: 462/464 looper letters, 27 selfloop transitions, 1 changer transitions 0/325 dead transitions. [2022-11-02 20:36:06,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 325 transitions, 757 flow [2022-11-02 20:36:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2022-11-02 20:36:06,385 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7543103448275862 [2022-11-02 20:36:06,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1050 transitions. [2022-11-02 20:36:06,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1050 transitions. [2022-11-02 20:36:06,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:06,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1050 transitions. [2022-11-02 20:36:06,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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 20:36:06,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:06,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:06,395 INFO L175 Difference]: Start difference. First operand has 332 places, 326 transitions, 703 flow. Second operand 3 states and 1050 transitions. [2022-11-02 20:36:06,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 325 transitions, 757 flow [2022-11-02 20:36:06,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 325 transitions, 727 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:36:06,402 INFO L231 Difference]: Finished difference. Result has 328 places, 325 transitions, 673 flow [2022-11-02 20:36:06,403 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=328, PETRI_TRANSITIONS=325} [2022-11-02 20:36:06,404 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -102 predicate places. [2022-11-02 20:36:06,404 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 325 transitions, 673 flow [2022-11-02 20:36:06,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:36:06,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:06,405 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] [2022-11-02 20:36:06,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:36:06,406 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash -11318480, now seen corresponding path program 1 times [2022-11-02 20:36:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:06,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942985684] [2022-11-02 20:36:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,474 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 20:36:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:06,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942985684] [2022-11-02 20:36:06,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942985684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:06,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:06,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628615344] [2022-11-02 20:36:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:06,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:06,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:06,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:06,478 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:36:06,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 325 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:36:06,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:06,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:36:06,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:07,408 INFO L130 PetriNetUnfolder]: 1232/3014 cut-off events. [2022-11-02 20:36:07,411 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:36:07,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 3014 events. 1232/3014 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20142 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 5058. Up to 1665 conditions per place. [2022-11-02 20:36:07,440 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 27 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2022-11-02 20:36:07,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 324 transitions, 729 flow [2022-11-02 20:36:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2022-11-02 20:36:07,444 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550287356321839 [2022-11-02 20:36:07,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2022-11-02 20:36:07,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2022-11-02 20:36:07,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:07,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2022-11-02 20:36:07,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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 20:36:07,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:07,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:07,452 INFO L175 Difference]: Start difference. First operand has 328 places, 325 transitions, 673 flow. Second operand 3 states and 1051 transitions. [2022-11-02 20:36:07,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 324 transitions, 729 flow [2022-11-02 20:36:07,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 324 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:07,460 INFO L231 Difference]: Finished difference. Result has 328 places, 324 transitions, 674 flow [2022-11-02 20:36:07,461 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=328, PETRI_TRANSITIONS=324} [2022-11-02 20:36:07,462 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -102 predicate places. [2022-11-02 20:36:07,463 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 324 transitions, 674 flow [2022-11-02 20:36:07,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:36:07,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:07,464 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] [2022-11-02 20:36:07,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:36:07,464 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1151112271, now seen corresponding path program 1 times [2022-11-02 20:36:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219382868] [2022-11-02 20:36:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,584 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 20:36:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:07,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219382868] [2022-11-02 20:36:07,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219382868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:07,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:07,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486780669] [2022-11-02 20:36:07,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:07,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:07,588 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 464 [2022-11-02 20:36:07,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 324 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:36:07,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:07,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 464 [2022-11-02 20:36:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:08,602 INFO L130 PetriNetUnfolder]: 1232/3012 cut-off events. [2022-11-02 20:36:08,603 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:36:08,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 3012 events. 1232/3012 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20140 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 5058. Up to 1665 conditions per place. [2022-11-02 20:36:08,637 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 29 selfloop transitions, 1 changer transitions 0/322 dead transitions. [2022-11-02 20:36:08,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 322 transitions, 730 flow [2022-11-02 20:36:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1044 transitions. [2022-11-02 20:36:08,641 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-11-02 20:36:08,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1044 transitions. [2022-11-02 20:36:08,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1044 transitions. [2022-11-02 20:36:08,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:08,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1044 transitions. [2022-11-02 20:36:08,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 20:36:08,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:08,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:08,649 INFO L175 Difference]: Start difference. First operand has 328 places, 324 transitions, 674 flow. Second operand 3 states and 1044 transitions. [2022-11-02 20:36:08,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 322 transitions, 730 flow [2022-11-02 20:36:08,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 322 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:08,658 INFO L231 Difference]: Finished difference. Result has 326 places, 322 transitions, 668 flow [2022-11-02 20:36:08,659 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=326, PETRI_TRANSITIONS=322} [2022-11-02 20:36:08,660 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -104 predicate places. [2022-11-02 20:36:08,660 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 322 transitions, 668 flow [2022-11-02 20:36:08,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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 20:36:08,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:08,661 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 20:36:08,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:36:08,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 46976292, now seen corresponding path program 1 times [2022-11-02 20:36:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:08,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053559346] [2022-11-02 20:36:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:08,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:08,768 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 20:36:08,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:08,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053559346] [2022-11-02 20:36:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053559346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:08,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254212358] [2022-11-02 20:36:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:08,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:08,779 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 464 [2022-11-02 20:36:08,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 322 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:36:08,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:08,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 464 [2022-11-02 20:36:08,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:09,910 INFO L130 PetriNetUnfolder]: 1232/3011 cut-off events. [2022-11-02 20:36:09,910 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:36:09,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5144 conditions, 3011 events. 1232/3011 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20165 event pairs, 858 based on Foata normal form. 0/2635 useless extension candidates. Maximal degree in co-relation 5056. Up to 1665 conditions per place. [2022-11-02 20:36:09,941 INFO L137 encePairwiseOnDemand]: 461/464 looper letters, 27 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2022-11-02 20:36:09,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 321 transitions, 724 flow [2022-11-02 20:36:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2022-11-02 20:36:09,946 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550287356321839 [2022-11-02 20:36:09,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2022-11-02 20:36:09,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2022-11-02 20:36:09,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:09,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2022-11-02 20:36:09,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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 20:36:09,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:09,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:09,957 INFO L175 Difference]: Start difference. First operand has 326 places, 322 transitions, 668 flow. Second operand 3 states and 1051 transitions. [2022-11-02 20:36:09,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 321 transitions, 724 flow [2022-11-02 20:36:09,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:09,966 INFO L231 Difference]: Finished difference. Result has 326 places, 321 transitions, 669 flow [2022-11-02 20:36:09,967 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=326, PETRI_TRANSITIONS=321} [2022-11-02 20:36:09,968 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -104 predicate places. [2022-11-02 20:36:09,968 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 321 transitions, 669 flow [2022-11-02 20:36:09,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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 20:36:09,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:09,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:36:09,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:36:09,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1500350687, now seen corresponding path program 1 times [2022-11-02 20:36:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:09,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135607830] [2022-11-02 20:36:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:11,044 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 20:36:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:11,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135607830] [2022-11-02 20:36:11,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135607830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:11,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:11,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528248033] [2022-11-02 20:36:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:11,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:11,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:11,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:11,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:11,052 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 464 [2022-11-02 20:36:11,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 321 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 301.1666666666667) internal successors, (1807), 6 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states 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 20:36:11,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:11,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 464 [2022-11-02 20:36:11,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:15,979 INFO L130 PetriNetUnfolder]: 8768/13188 cut-off events. [2022-11-02 20:36:15,979 INFO L131 PetriNetUnfolder]: For 2412/2412 co-relation queries the response was YES. [2022-11-02 20:36:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26976 conditions, 13188 events. 8768/13188 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 73953 event pairs, 1452 based on Foata normal form. 0/12672 useless extension candidates. Maximal degree in co-relation 26887. Up to 4804 conditions per place. [2022-11-02 20:36:16,078 INFO L137 encePairwiseOnDemand]: 459/464 looper letters, 126 selfloop transitions, 4 changer transitions 0/384 dead transitions. [2022-11-02 20:36:16,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 384 transitions, 1087 flow [2022-11-02 20:36:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1915 transitions. [2022-11-02 20:36:16,084 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6878591954022989 [2022-11-02 20:36:16,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1915 transitions. [2022-11-02 20:36:16,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1915 transitions. [2022-11-02 20:36:16,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:16,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1915 transitions. [2022-11-02 20:36:16,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 319.1666666666667) internal successors, (1915), 6 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states 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 20:36:16,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:16,098 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:16,099 INFO L175 Difference]: Start difference. First operand has 326 places, 321 transitions, 669 flow. Second operand 6 states and 1915 transitions. [2022-11-02 20:36:16,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 384 transitions, 1087 flow [2022-11-02 20:36:16,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 384 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:16,108 INFO L231 Difference]: Finished difference. Result has 328 places, 320 transitions, 671 flow [2022-11-02 20:36:16,109 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=328, PETRI_TRANSITIONS=320} [2022-11-02 20:36:16,109 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -102 predicate places. [2022-11-02 20:36:16,110 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 320 transitions, 671 flow [2022-11-02 20:36:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.1666666666667) internal successors, (1807), 6 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states 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 20:36:16,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:16,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:36:16,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:36:16,112 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1324542779, now seen corresponding path program 1 times [2022-11-02 20:36:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:16,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957278807] [2022-11-02 20:36:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:17,048 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 20:36:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:17,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957278807] [2022-11-02 20:36:17,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957278807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:17,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:17,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353564835] [2022-11-02 20:36:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:17,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:17,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:17,054 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 464 [2022-11-02 20:36:17,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 320 transitions, 671 flow. Second operand has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states 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 20:36:17,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:17,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 464 [2022-11-02 20:36:17,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:21,804 INFO L130 PetriNetUnfolder]: 7748/11879 cut-off events. [2022-11-02 20:36:21,804 INFO L131 PetriNetUnfolder]: For 2664/2664 co-relation queries the response was YES. [2022-11-02 20:36:21,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25160 conditions, 11879 events. 7748/11879 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 67399 event pairs, 4815 based on Foata normal form. 0/11384 useless extension candidates. Maximal degree in co-relation 25071. Up to 8275 conditions per place. [2022-11-02 20:36:21,907 INFO L137 encePairwiseOnDemand]: 459/464 looper letters, 109 selfloop transitions, 4 changer transitions 0/367 dead transitions. [2022-11-02 20:36:21,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 367 transitions, 1023 flow [2022-11-02 20:36:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1898 transitions. [2022-11-02 20:36:21,915 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6817528735632183 [2022-11-02 20:36:21,915 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1898 transitions. [2022-11-02 20:36:21,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1898 transitions. [2022-11-02 20:36:21,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:21,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1898 transitions. [2022-11-02 20:36:21,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 316.3333333333333) internal successors, (1898), 6 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states 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 20:36:21,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:21,931 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:21,932 INFO L175 Difference]: Start difference. First operand has 328 places, 320 transitions, 671 flow. Second operand 6 states and 1898 transitions. [2022-11-02 20:36:21,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 367 transitions, 1023 flow [2022-11-02 20:36:21,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 367 transitions, 1016 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:21,945 INFO L231 Difference]: Finished difference. Result has 328 places, 319 transitions, 670 flow [2022-11-02 20:36:21,945 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=670, PETRI_PLACES=328, PETRI_TRANSITIONS=319} [2022-11-02 20:36:21,946 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -102 predicate places. [2022-11-02 20:36:21,946 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 319 transitions, 670 flow [2022-11-02 20:36:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states 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 20:36:21,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:21,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:36:21,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:36:21,948 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1890779486, now seen corresponding path program 1 times [2022-11-02 20:36:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506423268] [2022-11-02 20:36:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:23,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506423268] [2022-11-02 20:36:23,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506423268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:23,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:23,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162754019] [2022-11-02 20:36:23,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:23,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:23,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:23,151 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 464 [2022-11-02 20:36:23,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 319 transitions, 670 flow. Second operand has 6 states, 6 states have (on average 303.5) internal successors, (1821), 6 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states 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 20:36:23,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:23,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 464 [2022-11-02 20:36:23,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:27,184 INFO L130 PetriNetUnfolder]: 7584/11764 cut-off events. [2022-11-02 20:36:27,184 INFO L131 PetriNetUnfolder]: For 2156/2156 co-relation queries the response was YES. [2022-11-02 20:36:27,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24253 conditions, 11764 events. 7584/11764 cut-off events. For 2156/2156 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 67336 event pairs, 5460 based on Foata normal form. 0/11251 useless extension candidates. Maximal degree in co-relation 24164. Up to 9435 conditions per place. [2022-11-02 20:36:27,272 INFO L137 encePairwiseOnDemand]: 459/464 looper letters, 92 selfloop transitions, 4 changer transitions 0/350 dead transitions. [2022-11-02 20:36:27,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 350 transitions, 956 flow [2022-11-02 20:36:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2022-11-02 20:36:27,280 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6756465517241379 [2022-11-02 20:36:27,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1881 transitions. [2022-11-02 20:36:27,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1881 transitions. [2022-11-02 20:36:27,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:27,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1881 transitions. [2022-11-02 20:36:27,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 313.5) internal successors, (1881), 6 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states 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 20:36:27,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:27,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:27,297 INFO L175 Difference]: Start difference. First operand has 328 places, 319 transitions, 670 flow. Second operand 6 states and 1881 transitions. [2022-11-02 20:36:27,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 350 transitions, 956 flow [2022-11-02 20:36:27,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 350 transitions, 949 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:27,310 INFO L231 Difference]: Finished difference. Result has 328 places, 318 transitions, 669 flow [2022-11-02 20:36:27,311 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=669, PETRI_PLACES=328, PETRI_TRANSITIONS=318} [2022-11-02 20:36:27,312 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -102 predicate places. [2022-11-02 20:36:27,312 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 318 transitions, 669 flow [2022-11-02 20:36:27,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.5) internal successors, (1821), 6 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states 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 20:36:27,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:27,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:36:27,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:36:27,314 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 886840013, now seen corresponding path program 1 times [2022-11-02 20:36:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:27,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077658109] [2022-11-02 20:36:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:28,562 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 20:36:28,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:28,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077658109] [2022-11-02 20:36:28,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077658109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:28,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121797330] [2022-11-02 20:36:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:28,568 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 464 [2022-11-02 20:36:28,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 318 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 304.6666666666667) internal successors, (1828), 6 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states 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 20:36:28,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:28,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 464 [2022-11-02 20:36:28,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:32,595 INFO L130 PetriNetUnfolder]: 7712/11893 cut-off events. [2022-11-02 20:36:32,596 INFO L131 PetriNetUnfolder]: For 2124/2124 co-relation queries the response was YES. [2022-11-02 20:36:32,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24430 conditions, 11893 events. 7712/11893 cut-off events. For 2124/2124 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 67518 event pairs, 5688 based on Foata normal form. 0/11393 useless extension candidates. Maximal degree in co-relation 24341. Up to 9867 conditions per place. [2022-11-02 20:36:32,686 INFO L137 encePairwiseOnDemand]: 459/464 looper letters, 75 selfloop transitions, 4 changer transitions 0/333 dead transitions. [2022-11-02 20:36:32,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 333 transitions, 873 flow [2022-11-02 20:36:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1868 transitions. [2022-11-02 20:36:32,691 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6709770114942529 [2022-11-02 20:36:32,692 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1868 transitions. [2022-11-02 20:36:32,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1868 transitions. [2022-11-02 20:36:32,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:32,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1868 transitions. [2022-11-02 20:36:32,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 311.3333333333333) internal successors, (1868), 6 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states 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 20:36:32,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:32,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 464.0) internal successors, (3248), 7 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states 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 20:36:32,706 INFO L175 Difference]: Start difference. First operand has 328 places, 318 transitions, 669 flow. Second operand 6 states and 1868 transitions. [2022-11-02 20:36:32,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 333 transitions, 873 flow [2022-11-02 20:36:32,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 333 transitions, 866 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:32,714 INFO L231 Difference]: Finished difference. Result has 328 places, 317 transitions, 668 flow [2022-11-02 20:36:32,715 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=328, PETRI_TRANSITIONS=317} [2022-11-02 20:36:32,716 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -102 predicate places. [2022-11-02 20:36:32,716 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 317 transitions, 668 flow [2022-11-02 20:36:32,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.6666666666667) internal successors, (1828), 6 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states 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 20:36:32,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:32,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:36:32,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:36:32,718 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash -887866213, now seen corresponding path program 1 times [2022-11-02 20:36:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:32,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014258611] [2022-11-02 20:36:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:32,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:32,839 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 20:36:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:32,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014258611] [2022-11-02 20:36:32,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014258611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:32,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:32,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572573942] [2022-11-02 20:36:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:32,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:32,844 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 464 [2022-11-02 20:36:32,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 317 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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 20:36:32,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:32,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 464 [2022-11-02 20:36:32,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:33,932 INFO L130 PetriNetUnfolder]: 1232/3002 cut-off events. [2022-11-02 20:36:33,933 INFO L131 PetriNetUnfolder]: For 464/632 co-relation queries the response was YES. [2022-11-02 20:36:33,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 3002 events. 1232/3002 cut-off events. For 464/632 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20026 event pairs, 858 based on Foata normal form. 4/2635 useless extension candidates. Maximal degree in co-relation 5102. Up to 1662 conditions per place. [2022-11-02 20:36:33,945 INFO L137 encePairwiseOnDemand]: 462/464 looper letters, 0 selfloop transitions, 0 changer transitions 316/316 dead transitions. [2022-11-02 20:36:33,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 316 transitions, 716 flow [2022-11-02 20:36:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1056 transitions. [2022-11-02 20:36:33,950 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7586206896551724 [2022-11-02 20:36:33,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1056 transitions. [2022-11-02 20:36:33,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1056 transitions. [2022-11-02 20:36:33,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:33,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1056 transitions. [2022-11-02 20:36:33,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states 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 20:36:33,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:33,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 464.0) internal successors, (1856), 4 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 20:36:33,958 INFO L175 Difference]: Start difference. First operand has 328 places, 317 transitions, 668 flow. Second operand 3 states and 1056 transitions. [2022-11-02 20:36:33,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 316 transitions, 716 flow [2022-11-02 20:36:33,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 316 transitions, 709 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:33,964 INFO L231 Difference]: Finished difference. Result has 325 places, 0 transitions, 0 flow [2022-11-02 20:36:33,964 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=325, PETRI_TRANSITIONS=0} [2022-11-02 20:36:33,965 INFO L287 CegarLoopForPetriNet]: 430 programPoint places, -105 predicate places. [2022-11-02 20:36:33,965 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 0 transitions, 0 flow [2022-11-02 20:36:33,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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 20:36:33,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (185 of 186 remaining) [2022-11-02 20:36:33,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (184 of 186 remaining) [2022-11-02 20:36:33,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (183 of 186 remaining) [2022-11-02 20:36:33,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (182 of 186 remaining) [2022-11-02 20:36:33,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (181 of 186 remaining) [2022-11-02 20:36:33,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (180 of 186 remaining) [2022-11-02 20:36:33,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 186 remaining) [2022-11-02 20:36:33,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (178 of 186 remaining) [2022-11-02 20:36:33,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (177 of 186 remaining) [2022-11-02 20:36:33,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (176 of 186 remaining) [2022-11-02 20:36:33,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (175 of 186 remaining) [2022-11-02 20:36:33,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (174 of 186 remaining) [2022-11-02 20:36:33,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (173 of 186 remaining) [2022-11-02 20:36:33,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (172 of 186 remaining) [2022-11-02 20:36:33,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (171 of 186 remaining) [2022-11-02 20:36:33,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (170 of 186 remaining) [2022-11-02 20:36:33,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (169 of 186 remaining) [2022-11-02 20:36:33,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (168 of 186 remaining) [2022-11-02 20:36:33,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (167 of 186 remaining) [2022-11-02 20:36:33,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (166 of 186 remaining) [2022-11-02 20:36:33,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (165 of 186 remaining) [2022-11-02 20:36:33,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (164 of 186 remaining) [2022-11-02 20:36:33,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (163 of 186 remaining) [2022-11-02 20:36:33,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 186 remaining) [2022-11-02 20:36:33,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (161 of 186 remaining) [2022-11-02 20:36:33,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (160 of 186 remaining) [2022-11-02 20:36:33,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (159 of 186 remaining) [2022-11-02 20:36:33,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (158 of 186 remaining) [2022-11-02 20:36:33,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (157 of 186 remaining) [2022-11-02 20:36:33,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (156 of 186 remaining) [2022-11-02 20:36:33,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (155 of 186 remaining) [2022-11-02 20:36:33,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (154 of 186 remaining) [2022-11-02 20:36:33,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (153 of 186 remaining) [2022-11-02 20:36:33,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (152 of 186 remaining) [2022-11-02 20:36:33,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (151 of 186 remaining) [2022-11-02 20:36:33,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (150 of 186 remaining) [2022-11-02 20:36:33,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (149 of 186 remaining) [2022-11-02 20:36:33,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (148 of 186 remaining) [2022-11-02 20:36:33,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (147 of 186 remaining) [2022-11-02 20:36:33,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (146 of 186 remaining) [2022-11-02 20:36:33,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (145 of 186 remaining) [2022-11-02 20:36:33,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 186 remaining) [2022-11-02 20:36:33,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (143 of 186 remaining) [2022-11-02 20:36:33,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (142 of 186 remaining) [2022-11-02 20:36:33,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 186 remaining) [2022-11-02 20:36:33,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 186 remaining) [2022-11-02 20:36:33,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (139 of 186 remaining) [2022-11-02 20:36:33,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (138 of 186 remaining) [2022-11-02 20:36:33,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (137 of 186 remaining) [2022-11-02 20:36:33,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (136 of 186 remaining) [2022-11-02 20:36:33,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (135 of 186 remaining) [2022-11-02 20:36:33,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (134 of 186 remaining) [2022-11-02 20:36:33,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (133 of 186 remaining) [2022-11-02 20:36:33,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 186 remaining) [2022-11-02 20:36:33,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 186 remaining) [2022-11-02 20:36:33,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (130 of 186 remaining) [2022-11-02 20:36:33,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (129 of 186 remaining) [2022-11-02 20:36:33,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (128 of 186 remaining) [2022-11-02 20:36:33,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (127 of 186 remaining) [2022-11-02 20:36:33,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (126 of 186 remaining) [2022-11-02 20:36:33,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (125 of 186 remaining) [2022-11-02 20:36:33,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (124 of 186 remaining) [2022-11-02 20:36:33,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (123 of 186 remaining) [2022-11-02 20:36:33,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (122 of 186 remaining) [2022-11-02 20:36:33,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (121 of 186 remaining) [2022-11-02 20:36:33,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (120 of 186 remaining) [2022-11-02 20:36:33,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (119 of 186 remaining) [2022-11-02 20:36:33,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (118 of 186 remaining) [2022-11-02 20:36:33,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (117 of 186 remaining) [2022-11-02 20:36:33,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (116 of 186 remaining) [2022-11-02 20:36:33,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (115 of 186 remaining) [2022-11-02 20:36:33,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (114 of 186 remaining) [2022-11-02 20:36:33,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (113 of 186 remaining) [2022-11-02 20:36:33,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (112 of 186 remaining) [2022-11-02 20:36:33,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (111 of 186 remaining) [2022-11-02 20:36:33,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (110 of 186 remaining) [2022-11-02 20:36:33,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (109 of 186 remaining) [2022-11-02 20:36:33,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (108 of 186 remaining) [2022-11-02 20:36:33,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (107 of 186 remaining) [2022-11-02 20:36:33,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (106 of 186 remaining) [2022-11-02 20:36:33,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (105 of 186 remaining) [2022-11-02 20:36:33,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (104 of 186 remaining) [2022-11-02 20:36:33,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (103 of 186 remaining) [2022-11-02 20:36:33,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 186 remaining) [2022-11-02 20:36:33,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 186 remaining) [2022-11-02 20:36:33,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 186 remaining) [2022-11-02 20:36:33,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 186 remaining) [2022-11-02 20:36:33,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 186 remaining) [2022-11-02 20:36:33,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 186 remaining) [2022-11-02 20:36:33,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 186 remaining) [2022-11-02 20:36:34,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 186 remaining) [2022-11-02 20:36:34,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 186 remaining) [2022-11-02 20:36:34,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 186 remaining) [2022-11-02 20:36:34,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 186 remaining) [2022-11-02 20:36:34,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 186 remaining) [2022-11-02 20:36:34,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 186 remaining) [2022-11-02 20:36:34,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 186 remaining) [2022-11-02 20:36:34,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 186 remaining) [2022-11-02 20:36:34,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 186 remaining) [2022-11-02 20:36:34,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 186 remaining) [2022-11-02 20:36:34,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 186 remaining) [2022-11-02 20:36:34,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 186 remaining) [2022-11-02 20:36:34,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 186 remaining) [2022-11-02 20:36:34,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 186 remaining) [2022-11-02 20:36:34,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 186 remaining) [2022-11-02 20:36:34,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 186 remaining) [2022-11-02 20:36:34,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 186 remaining) [2022-11-02 20:36:34,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 186 remaining) [2022-11-02 20:36:34,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 186 remaining) [2022-11-02 20:36:34,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 186 remaining) [2022-11-02 20:36:34,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 186 remaining) [2022-11-02 20:36:34,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 186 remaining) [2022-11-02 20:36:34,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 186 remaining) [2022-11-02 20:36:34,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 186 remaining) [2022-11-02 20:36:34,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 186 remaining) [2022-11-02 20:36:34,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 186 remaining) [2022-11-02 20:36:34,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 186 remaining) [2022-11-02 20:36:34,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 186 remaining) [2022-11-02 20:36:34,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 186 remaining) [2022-11-02 20:36:34,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 186 remaining) [2022-11-02 20:36:34,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 186 remaining) [2022-11-02 20:36:34,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 186 remaining) [2022-11-02 20:36:34,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 186 remaining) [2022-11-02 20:36:34,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 186 remaining) [2022-11-02 20:36:34,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 186 remaining) [2022-11-02 20:36:34,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 186 remaining) [2022-11-02 20:36:34,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 186 remaining) [2022-11-02 20:36:34,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 186 remaining) [2022-11-02 20:36:34,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 186 remaining) [2022-11-02 20:36:34,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 186 remaining) [2022-11-02 20:36:34,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 186 remaining) [2022-11-02 20:36:34,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 186 remaining) [2022-11-02 20:36:34,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 186 remaining) [2022-11-02 20:36:34,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 186 remaining) [2022-11-02 20:36:34,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 186 remaining) [2022-11-02 20:36:34,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 186 remaining) [2022-11-02 20:36:34,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 186 remaining) [2022-11-02 20:36:34,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 186 remaining) [2022-11-02 20:36:34,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 186 remaining) [2022-11-02 20:36:34,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 186 remaining) [2022-11-02 20:36:34,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 186 remaining) [2022-11-02 20:36:34,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 186 remaining) [2022-11-02 20:36:34,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 186 remaining) [2022-11-02 20:36:34,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 186 remaining) [2022-11-02 20:36:34,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 186 remaining) [2022-11-02 20:36:34,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 186 remaining) [2022-11-02 20:36:34,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 186 remaining) [2022-11-02 20:36:34,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 186 remaining) [2022-11-02 20:36:34,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 186 remaining) [2022-11-02 20:36:34,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 186 remaining) [2022-11-02 20:36:34,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 186 remaining) [2022-11-02 20:36:34,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 186 remaining) [2022-11-02 20:36:34,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 186 remaining) [2022-11-02 20:36:34,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 186 remaining) [2022-11-02 20:36:34,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 186 remaining) [2022-11-02 20:36:34,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 186 remaining) [2022-11-02 20:36:34,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 186 remaining) [2022-11-02 20:36:34,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 186 remaining) [2022-11-02 20:36:34,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 186 remaining) [2022-11-02 20:36:34,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 186 remaining) [2022-11-02 20:36:34,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 186 remaining) [2022-11-02 20:36:34,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 186 remaining) [2022-11-02 20:36:34,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 186 remaining) [2022-11-02 20:36:34,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 186 remaining) [2022-11-02 20:36:34,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 186 remaining) [2022-11-02 20:36:34,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 186 remaining) [2022-11-02 20:36:34,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 186 remaining) [2022-11-02 20:36:34,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 186 remaining) [2022-11-02 20:36:34,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 186 remaining) [2022-11-02 20:36:34,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 186 remaining) [2022-11-02 20:36:34,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 186 remaining) [2022-11-02 20:36:34,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 186 remaining) [2022-11-02 20:36:34,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 186 remaining) [2022-11-02 20:36:34,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 186 remaining) [2022-11-02 20:36:34,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 186 remaining) [2022-11-02 20:36:34,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 186 remaining) [2022-11-02 20:36:34,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 186 remaining) [2022-11-02 20:36:34,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 186 remaining) [2022-11-02 20:36:34,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 186 remaining) [2022-11-02 20:36:34,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 186 remaining) [2022-11-02 20:36:34,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 186 remaining) [2022-11-02 20:36:34,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 186 remaining) [2022-11-02 20:36:34,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 186 remaining) [2022-11-02 20:36:34,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 186 remaining) [2022-11-02 20:36:34,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 186 remaining) [2022-11-02 20:36:34,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 186 remaining) [2022-11-02 20:36:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:36:34,023 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:34,036 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:36:34,036 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:36:34,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:36:34 BasicIcfg [2022-11-02 20:36:34,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:36:34,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:36:34,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:36:34,050 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:36:34,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:44" (3/4) ... [2022-11-02 20:36:34,054 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:36:34,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:36:34,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:36:34,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:36:34,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:36:34,084 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2022-11-02 20:36:34,085 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:36:34,085 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:36:34,086 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:36:34,190 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:36:34,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:36:34,191 INFO L158 Benchmark]: Toolchain (without parser) took 53157.66ms. Allocated memory was 102.8MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 68.1MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-02 20:36:34,192 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 102.8MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:34,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.44ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 72.7MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:36:34,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.30ms. Allocated memory is still 102.8MB. Free memory was 72.7MB in the beginning and 68.1MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:36:34,193 INFO L158 Benchmark]: Boogie Preprocessor took 70.04ms. Allocated memory is still 102.8MB. Free memory was 68.1MB in the beginning and 63.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:36:34,194 INFO L158 Benchmark]: RCFGBuilder took 2578.87ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 63.9MB in the beginning and 67.6MB in the end (delta: -3.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-11-02 20:36:34,196 INFO L158 Benchmark]: TraceAbstraction took 49612.87ms. Allocated memory was 151.0MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 66.5MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-02 20:36:34,196 INFO L158 Benchmark]: Witness Printer took 141.04ms. Allocated memory is still 9.6GB. Free memory was 8.1GB in the beginning and 8.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:36:34,205 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.38ms. Allocated memory is still 102.8MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.44ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 72.7MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.30ms. Allocated memory is still 102.8MB. Free memory was 72.7MB in the beginning and 68.1MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.04ms. Allocated memory is still 102.8MB. Free memory was 68.1MB in the beginning and 63.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2578.87ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 63.9MB in the beginning and 67.6MB in the end (delta: -3.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * TraceAbstraction took 49612.87ms. Allocated memory was 151.0MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 66.5MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 141.04ms. Allocated memory is still 9.6GB. Free memory was 8.1GB in the beginning and 8.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 79]: 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: 82]: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: 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 9 procedures, 556 locations, 186 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: 49.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 245 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=0, InterpolantAutomatonStates: 78, 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.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2585 NumberOfCodeBlocks, 2585 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2564 ConstructedInterpolants, 0 QuantifiedInterpolants, 3035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 103 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:36:34,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_928be58e-f00b-43c9-8113-863b35b0dc4e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE